java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:01:09,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:01:09,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:01:09,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:01:09,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:01:09,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:01:09,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:01:09,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:01:09,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:01:09,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:01:09,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:01:09,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:01:09,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:01:09,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:01:09,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:01:09,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:01:09,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:01:09,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:01:09,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:01:09,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:01:09,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:01:09,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:01:09,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:01:09,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:01:09,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:01:09,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:01:09,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:01:09,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:01:09,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:01:09,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:01:09,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:01:09,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:01:09,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:01:09,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:01:09,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:01:09,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:01:09,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:01:09,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:01:09,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:01:09,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:01:09,843 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:01:09,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:01:09,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:01:09,844 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:01:09,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:01:09,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:01:09,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:01:09,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:01:09,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:01:09,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:01:09,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:01:09,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:01:09,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:01:09,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:01:09,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:01:09,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:01:09,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:01:09,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:01:09,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:01:09,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:01:09,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:09,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:01:09,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:01:09,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:01:09,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:01:09,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:01:09,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:01:09,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:01:09,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:01:09,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:01:09,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:01:09,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:01:09,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:01:09,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i [2018-11-23 12:01:09,981 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f821d4c/14601f949a5c429caea7c15a6c248af4/FLAG45307d60f [2018-11-23 12:01:10,417 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:01:10,418 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_true-unreach-call_ground.i [2018-11-23 12:01:10,430 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f821d4c/14601f949a5c429caea7c15a6c248af4/FLAG45307d60f [2018-11-23 12:01:10,793 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f821d4c/14601f949a5c429caea7c15a6c248af4 [2018-11-23 12:01:10,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:01:10,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:01:10,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:10,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:01:10,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:01:10,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:10" (1/1) ... [2018-11-23 12:01:10,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ba15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:10, skipping insertion in model container [2018-11-23 12:01:10,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:10" (1/1) ... [2018-11-23 12:01:10,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:01:10,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:01:11,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:11,144 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:01:11,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:11,233 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:01:11,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11 WrapperNode [2018-11-23 12:01:11,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:11,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:11,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:01:11,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:01:11,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:11,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:01:11,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:01:11,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:01:11,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... [2018-11-23 12:01:11,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:01:11,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:01:11,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:01:11,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:01:11,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:11,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:01:11,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:01:11,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:01:11,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:01:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:01:11,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:01:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:01:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:01:11,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:01:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:01:11,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:01:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:01:12,679 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:01:12,680 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 12:01:12,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:12 BoogieIcfgContainer [2018-11-23 12:01:12,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:01:12,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:01:12,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:01:12,685 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:01:12,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:10" (1/3) ... [2018-11-23 12:01:12,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a4341f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:12, skipping insertion in model container [2018-11-23 12:01:12,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:11" (2/3) ... [2018-11-23 12:01:12,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a4341f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:12, skipping insertion in model container [2018-11-23 12:01:12,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:12" (3/3) ... [2018-11-23 12:01:12,689 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy9_true-unreach-call_ground.i [2018-11-23 12:01:12,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:01:12,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:01:12,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:01:12,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:01:12,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:01:12,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:01:12,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:01:12,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:01:12,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:01:12,757 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:01:12,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:01:12,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:01:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 12:01:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:01:12,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:12,786 INFO L402 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] [2018-11-23 12:01:12,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:12,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash -178932642, now seen corresponding path program 1 times [2018-11-23 12:01:12,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:12,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:12,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:12,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 12:01:12,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54#true} is VALID [2018-11-23 12:01:12,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:01:12,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #175#return; {54#true} is VALID [2018-11-23 12:01:12,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret23 := main(); {54#true} is VALID [2018-11-23 12:01:12,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#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; {54#true} is VALID [2018-11-23 12:01:12,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {54#true} assume !true; {55#false} is VALID [2018-11-23 12:01:12,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#false} havoc ~i~0;~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 12:01:12,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 12:01:12,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-23 12:01:12,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#false} ~i~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#false} assume !(~i~0 < 100000); {55#false} is VALID [2018-11-23 12:01:12,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {55#false} havoc ~x~0;~x~0 := 0; {55#false} is VALID [2018-11-23 12:01:12,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {55#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {55#false} is VALID [2018-11-23 12:01:12,997 INFO L256 TraceCheckUtils]: 27: Hoare triple {55#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {55#false} is VALID [2018-11-23 12:01:12,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2018-11-23 12:01:12,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2018-11-23 12:01:12,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 12:01:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:01:13,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:01:13,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:13,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:01:13,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:13,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:01:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:01:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:13,146 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-23 12:01:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:13,395 INFO L93 Difference]: Finished difference Result 94 states and 137 transitions. [2018-11-23 12:01:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:01:13,396 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:01:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-23 12:01:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-23 12:01:13,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 137 transitions. [2018-11-23 12:01:14,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:14,193 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:01:14,194 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:01:14,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:01:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:01:14,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:14,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:01:14,272 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:01:14,272 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:01:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,279 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:01:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 12:01:14,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,280 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:01:14,280 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:01:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,285 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:01:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 12:01:14,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:14,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:14,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:14,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:01:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 12:01:14,292 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2018-11-23 12:01:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:14,293 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 12:01:14,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:01:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 12:01:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:01:14,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:14,295 INFO L402 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] [2018-11-23 12:01:14,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:14,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1311438022, now seen corresponding path program 1 times [2018-11-23 12:01:14,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:14,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:14,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:14,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 12:01:14,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 12:01:14,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 12:01:14,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #175#return; {336#true} is VALID [2018-11-23 12:01:14,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret23 := main(); {336#true} is VALID [2018-11-23 12:01:14,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#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; {338#(= main_~a~0 0)} is VALID [2018-11-23 12:01:14,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~a~0 0)} assume !(~a~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#false} havoc ~i~0;~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {337#false} ~i~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {337#false} assume !(~i~0 < 100000); {337#false} is VALID [2018-11-23 12:01:14,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {337#false} havoc ~x~0;~x~0 := 0; {337#false} is VALID [2018-11-23 12:01:14,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {337#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {337#false} is VALID [2018-11-23 12:01:14,410 INFO L256 TraceCheckUtils]: 27: Hoare triple {337#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {337#false} is VALID [2018-11-23 12:01:14,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2018-11-23 12:01:14,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2018-11-23 12:01:14,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 12:01:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:14,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:14,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:01:14,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:01:14,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:14,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:01:14,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:14,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:01:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:01:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:14,521 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-11-23 12:01:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:14,724 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-11-23 12:01:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:01:14,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:01:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:01:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:01:14,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 12:01:15,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,013 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:01:15,013 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:01:15,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:01:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 12:01:15,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:15,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 12:01:15,043 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 12:01:15,043 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 12:01:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,047 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:01:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:01:15,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,048 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 12:01:15,049 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 12:01:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,052 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:01:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:01:15,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:15,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:01:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 12:01:15,057 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2018-11-23 12:01:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:15,057 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 12:01:15,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:01:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 12:01:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:01:15,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:15,059 INFO L402 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] [2018-11-23 12:01:15,059 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:15,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -953933084, now seen corresponding path program 1 times [2018-11-23 12:01:15,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:15,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:15,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:15,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2018-11-23 12:01:15,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {618#true} is VALID [2018-11-23 12:01:15,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-23 12:01:15,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} #175#return; {618#true} is VALID [2018-11-23 12:01:15,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {618#true} call #t~ret23 := main(); {618#true} is VALID [2018-11-23 12:01:15,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {618#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; {618#true} is VALID [2018-11-23 12:01:15,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {618#true} is VALID [2018-11-23 12:01:15,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {618#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {618#true} is VALID [2018-11-23 12:01:15,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#true} assume !(~a~0 < 100000); {618#true} is VALID [2018-11-23 12:01:15,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {618#true} havoc ~i~0;~i~0 := 0; {620#(= main_~i~0 0)} is VALID [2018-11-23 12:01:15,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(= main_~i~0 0)} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {619#false} ~i~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {619#false} assume !(~i~0 < 100000); {619#false} is VALID [2018-11-23 12:01:15,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {619#false} havoc ~x~0;~x~0 := 0; {619#false} is VALID [2018-11-23 12:01:15,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {619#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {619#false} is VALID [2018-11-23 12:01:15,173 INFO L256 TraceCheckUtils]: 29: Hoare triple {619#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {619#false} is VALID [2018-11-23 12:01:15,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2018-11-23 12:01:15,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {619#false} assume 0 == ~cond; {619#false} is VALID [2018-11-23 12:01:15,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {619#false} assume !false; {619#false} is VALID [2018-11-23 12:01:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:01:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:01:15,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:01:15,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:15,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:01:15,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:01:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:01:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:15,296 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 3 states. [2018-11-23 12:01:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,581 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2018-11-23 12:01:15,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:01:15,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:01:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:01:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:01:15,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 12:01:15,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:15,769 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:01:15,770 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:01:15,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:01:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-23 12:01:15,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:15,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 56 states. [2018-11-23 12:01:15,828 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 56 states. [2018-11-23 12:01:15,829 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 56 states. [2018-11-23 12:01:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,832 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 12:01:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 12:01:15,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,834 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 65 states. [2018-11-23 12:01:15,834 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 65 states. [2018-11-23 12:01:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:15,837 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 12:01:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 12:01:15,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:15,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:15,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:15,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:01:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-23 12:01:15,842 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 33 [2018-11-23 12:01:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:15,843 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-23 12:01:15,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:01:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-23 12:01:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:01:15,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:15,845 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:15,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:15,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -753251022, now seen corresponding path program 1 times [2018-11-23 12:01:15,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:16,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:01:16,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:01:16,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:01:16,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #175#return; {974#true} is VALID [2018-11-23 12:01:16,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret23 := main(); {974#true} is VALID [2018-11-23 12:01:16,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#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; {976#(= main_~a~0 0)} is VALID [2018-11-23 12:01:16,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {976#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {976#(= main_~a~0 0)} is VALID [2018-11-23 12:01:16,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {976#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {977#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:16,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {977#(<= main_~a~0 1)} assume !(~a~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {975#false} havoc ~i~0;~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {975#false} is VALID [2018-11-23 12:01:16,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {975#false} is VALID [2018-11-23 12:01:16,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {975#false} is VALID [2018-11-23 12:01:16,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {975#false} is VALID [2018-11-23 12:01:16,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {975#false} is VALID [2018-11-23 12:01:16,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {975#false} is VALID [2018-11-23 12:01:16,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {975#false} is VALID [2018-11-23 12:01:16,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {975#false} is VALID [2018-11-23 12:01:16,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {975#false} is VALID [2018-11-23 12:01:16,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {975#false} is VALID [2018-11-23 12:01:16,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {975#false} is VALID [2018-11-23 12:01:16,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {975#false} is VALID [2018-11-23 12:01:16,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {975#false} is VALID [2018-11-23 12:01:16,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {975#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {975#false} is VALID [2018-11-23 12:01:16,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {975#false} is VALID [2018-11-23 12:01:16,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {975#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {975#false} is VALID [2018-11-23 12:01:16,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {975#false} is VALID [2018-11-23 12:01:16,041 INFO L273 TraceCheckUtils]: 43: Hoare triple {975#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {975#false} is VALID [2018-11-23 12:01:16,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {975#false} havoc ~x~0;~x~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,042 INFO L273 TraceCheckUtils]: 46: Hoare triple {975#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {975#false} is VALID [2018-11-23 12:01:16,042 INFO L256 TraceCheckUtils]: 47: Hoare triple {975#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {975#false} is VALID [2018-11-23 12:01:16,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {975#false} ~cond := #in~cond; {975#false} is VALID [2018-11-23 12:01:16,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {975#false} assume 0 == ~cond; {975#false} is VALID [2018-11-23 12:01:16,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:01:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:01:16,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:16,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:16,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:16,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:16,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:01:16,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:01:16,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:01:16,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #175#return; {974#true} is VALID [2018-11-23 12:01:16,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret23 := main(); {974#true} is VALID [2018-11-23 12:01:16,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#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; {996#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:16,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {996#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {996#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:16,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {996#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {977#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:16,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {977#(<= main_~a~0 1)} assume !(~a~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {975#false} havoc ~i~0;~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {975#false} is VALID [2018-11-23 12:01:16,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {975#false} is VALID [2018-11-23 12:01:16,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {975#false} is VALID [2018-11-23 12:01:16,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {975#false} is VALID [2018-11-23 12:01:16,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {975#false} is VALID [2018-11-23 12:01:16,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {975#false} is VALID [2018-11-23 12:01:16,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {975#false} is VALID [2018-11-23 12:01:16,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {975#false} is VALID [2018-11-23 12:01:16,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {975#false} is VALID [2018-11-23 12:01:16,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {975#false} is VALID [2018-11-23 12:01:16,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {975#false} is VALID [2018-11-23 12:01:16,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {975#false} is VALID [2018-11-23 12:01:16,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {975#false} is VALID [2018-11-23 12:01:16,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {975#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {975#false} is VALID [2018-11-23 12:01:16,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {975#false} is VALID [2018-11-23 12:01:16,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {975#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {975#false} is VALID [2018-11-23 12:01:16,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,503 INFO L273 TraceCheckUtils]: 41: Hoare triple {975#false} ~i~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {975#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {975#false} is VALID [2018-11-23 12:01:16,504 INFO L273 TraceCheckUtils]: 43: Hoare triple {975#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {975#false} is VALID [2018-11-23 12:01:16,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {975#false} assume !(~i~0 < 100000); {975#false} is VALID [2018-11-23 12:01:16,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {975#false} havoc ~x~0;~x~0 := 0; {975#false} is VALID [2018-11-23 12:01:16,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {975#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {975#false} is VALID [2018-11-23 12:01:16,505 INFO L256 TraceCheckUtils]: 47: Hoare triple {975#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {975#false} is VALID [2018-11-23 12:01:16,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {975#false} ~cond := #in~cond; {975#false} is VALID [2018-11-23 12:01:16,505 INFO L273 TraceCheckUtils]: 49: Hoare triple {975#false} assume 0 == ~cond; {975#false} is VALID [2018-11-23 12:01:16,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:01:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:01:16,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:16,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:01:16,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-23 12:01:16,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:16,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:01:16,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:16,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:01:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:01:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:16,789 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-11-23 12:01:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:17,031 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2018-11-23 12:01:17,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:01:17,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-23 12:01:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2018-11-23 12:01:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2018-11-23 12:01:17,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2018-11-23 12:01:17,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:17,246 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:01:17,247 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:01:17,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:01:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 12:01:17,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:17,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 12:01:17,277 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 12:01:17,278 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 12:01:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:17,281 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:01:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 12:01:17,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:17,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:17,283 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 12:01:17,283 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 12:01:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:17,286 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 12:01:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 12:01:17,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:17,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:17,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:17,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:01:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 12:01:17,290 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 51 [2018-11-23 12:01:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:17,290 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 12:01:17,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:01:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 12:01:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:01:17,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:17,292 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:17,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:17,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 194854992, now seen corresponding path program 2 times [2018-11-23 12:01:17,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2018-11-23 12:01:17,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1490#true} is VALID [2018-11-23 12:01:17,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2018-11-23 12:01:17,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #175#return; {1490#true} is VALID [2018-11-23 12:01:17,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret23 := main(); {1490#true} is VALID [2018-11-23 12:01:17,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {1490#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; {1492#(= main_~a~0 0)} is VALID [2018-11-23 12:01:17,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {1492#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {1492#(= main_~a~0 0)} is VALID [2018-11-23 12:01:17,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {1492#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1493#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:17,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {1493#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {1493#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:17,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1493#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1494#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:17,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {1494#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1491#false} havoc ~i~0;~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1491#false} is VALID [2018-11-23 12:01:17,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {1491#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1491#false} is VALID [2018-11-23 12:01:17,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1491#false} is VALID [2018-11-23 12:01:17,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {1491#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1491#false} is VALID [2018-11-23 12:01:17,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1491#false} is VALID [2018-11-23 12:01:17,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {1491#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1491#false} is VALID [2018-11-23 12:01:17,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1491#false} is VALID [2018-11-23 12:01:17,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {1491#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1491#false} is VALID [2018-11-23 12:01:17,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1491#false} is VALID [2018-11-23 12:01:17,456 INFO L273 TraceCheckUtils]: 29: Hoare triple {1491#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1491#false} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 32: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1491#false} is VALID [2018-11-23 12:01:17,457 INFO L273 TraceCheckUtils]: 33: Hoare triple {1491#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1491#false} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 35: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {1491#false} is VALID [2018-11-23 12:01:17,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {1491#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1491#false} is VALID [2018-11-23 12:01:17,459 INFO L273 TraceCheckUtils]: 38: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {1491#false} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 41: Hoare triple {1491#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1491#false} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {1491#false} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {1491#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {1491#false} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {1491#false} havoc ~x~0;~x~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {1491#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {1491#false} is VALID [2018-11-23 12:01:17,462 INFO L256 TraceCheckUtils]: 49: Hoare triple {1491#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1491#false} is VALID [2018-11-23 12:01:17,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2018-11-23 12:01:17,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2018-11-23 12:01:17,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2018-11-23 12:01:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:01:17,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:17,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:17,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:17,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:17,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:17,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:17,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2018-11-23 12:01:17,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1490#true} is VALID [2018-11-23 12:01:17,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2018-11-23 12:01:17,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #175#return; {1490#true} is VALID [2018-11-23 12:01:17,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret23 := main(); {1490#true} is VALID [2018-11-23 12:01:17,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {1490#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; {1490#true} is VALID [2018-11-23 12:01:17,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {1490#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1490#true} is VALID [2018-11-23 12:01:17,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {1490#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1490#true} is VALID [2018-11-23 12:01:17,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {1490#true} is VALID [2018-11-23 12:01:17,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {1490#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1490#true} is VALID [2018-11-23 12:01:17,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {1490#true} assume !(~a~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {1490#true} havoc ~i~0;~i~0 := 0; {1490#true} is VALID [2018-11-23 12:01:17,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {1490#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1490#true} is VALID [2018-11-23 12:01:17,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {1490#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1490#true} is VALID [2018-11-23 12:01:17,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 12:01:17,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {1490#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {1490#true} is VALID [2018-11-23 12:01:17,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {1490#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1490#true} is VALID [2018-11-23 12:01:17,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 12:01:17,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {1490#true} is VALID [2018-11-23 12:01:17,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {1490#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1490#true} is VALID [2018-11-23 12:01:17,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 12:01:17,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {1490#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {1490#true} is VALID [2018-11-23 12:01:17,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {1490#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1490#true} is VALID [2018-11-23 12:01:17,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {1490#true} ~i~0 := 0; {1490#true} is VALID [2018-11-23 12:01:17,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {1490#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {1490#true} is VALID [2018-11-23 12:01:17,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {1490#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1490#true} is VALID [2018-11-23 12:01:17,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(~i~0 < 100000); {1490#true} is VALID [2018-11-23 12:01:17,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {1490#true} ~i~0 := 0; {1591#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {1591#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {1591#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:17,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {1591#(<= main_~i~0 0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1598#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:17,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {1598#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {1491#false} is VALID [2018-11-23 12:01:17,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {1491#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1491#false} is VALID [2018-11-23 12:01:17,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {1491#false} is VALID [2018-11-23 12:01:17,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {1491#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1491#false} is VALID [2018-11-23 12:01:17,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {1491#false} ~i~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {1491#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {1491#false} is VALID [2018-11-23 12:01:17,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {1491#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {1491#false} is VALID [2018-11-23 12:01:17,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {1491#false} assume !(~i~0 < 100000); {1491#false} is VALID [2018-11-23 12:01:17,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {1491#false} havoc ~x~0;~x~0 := 0; {1491#false} is VALID [2018-11-23 12:01:17,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {1491#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {1491#false} is VALID [2018-11-23 12:01:17,720 INFO L256 TraceCheckUtils]: 49: Hoare triple {1491#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {1491#false} is VALID [2018-11-23 12:01:17,720 INFO L273 TraceCheckUtils]: 50: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2018-11-23 12:01:17,720 INFO L273 TraceCheckUtils]: 51: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2018-11-23 12:01:17,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2018-11-23 12:01:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:01:17,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:17,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 12:01:17,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-23 12:01:17,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:17,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:01:17,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:17,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:01:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:01:17,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:17,888 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 7 states. [2018-11-23 12:01:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:18,732 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-11-23 12:01:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:01:18,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-23 12:01:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 12:01:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 12:01:18,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-23 12:01:18,964 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-23 12:01:18,966 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:01:18,966 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:01:18,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-23 12:01:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:01:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-23 12:01:19,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:19,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 78 states. [2018-11-23 12:01:19,054 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 78 states. [2018-11-23 12:01:19,054 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 78 states. [2018-11-23 12:01:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:19,058 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-23 12:01:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 12:01:19,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:19,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:19,060 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 88 states. [2018-11-23 12:01:19,060 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 88 states. [2018-11-23 12:01:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:19,063 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-11-23 12:01:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 12:01:19,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:19,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:19,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:19,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:01:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-23 12:01:19,068 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 53 [2018-11-23 12:01:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:19,068 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-23 12:01:19,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:01:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-23 12:01:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:01:19,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:19,070 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:19,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:19,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1331683396, now seen corresponding path program 3 times [2018-11-23 12:01:19,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:19,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:19,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:01:19,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:01:19,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:01:19,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #175#return; {2141#true} is VALID [2018-11-23 12:01:19,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret23 := main(); {2141#true} is VALID [2018-11-23 12:01:19,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#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; {2143#(= main_~a~0 0)} is VALID [2018-11-23 12:01:19,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2143#(= main_~a~0 0)} is VALID [2018-11-23 12:01:19,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2144#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:19,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {2144#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2144#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:19,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {2144#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:19,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {2145#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2145#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:19,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {2145#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2146#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:19,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {2146#(<= main_~a~0 3)} assume !(~a~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#false} havoc ~i~0;~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:19,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:19,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:19,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:19,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2142#false} is VALID [2018-11-23 12:01:19,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {2142#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2142#false} is VALID [2018-11-23 12:01:19,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2142#false} is VALID [2018-11-23 12:01:19,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {2142#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2142#false} is VALID [2018-11-23 12:01:19,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2142#false} is VALID [2018-11-23 12:01:19,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2142#false} is VALID [2018-11-23 12:01:19,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2142#false} is VALID [2018-11-23 12:01:19,231 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2142#false} is VALID [2018-11-23 12:01:19,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2142#false} is VALID [2018-11-23 12:01:19,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {2142#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2142#false} is VALID [2018-11-23 12:01:19,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2142#false} is VALID [2018-11-23 12:01:19,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2142#false} is VALID [2018-11-23 12:01:19,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2142#false} is VALID [2018-11-23 12:01:19,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2142#false} is VALID [2018-11-23 12:01:19,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2142#false} is VALID [2018-11-23 12:01:19,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2142#false} is VALID [2018-11-23 12:01:19,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {2142#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2142#false} is VALID [2018-11-23 12:01:19,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2142#false} is VALID [2018-11-23 12:01:19,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {2142#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2142#false} is VALID [2018-11-23 12:01:19,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 57: Hoare triple {2142#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2142#false} is VALID [2018-11-23 12:01:19,236 INFO L273 TraceCheckUtils]: 58: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2142#false} is VALID [2018-11-23 12:01:19,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {2142#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2142#false} is VALID [2018-11-23 12:01:19,237 INFO L273 TraceCheckUtils]: 60: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,237 INFO L273 TraceCheckUtils]: 61: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,238 INFO L273 TraceCheckUtils]: 62: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2142#false} is VALID [2018-11-23 12:01:19,238 INFO L273 TraceCheckUtils]: 63: Hoare triple {2142#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2142#false} is VALID [2018-11-23 12:01:19,238 INFO L273 TraceCheckUtils]: 64: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2142#false} is VALID [2018-11-23 12:01:19,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {2142#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2142#false} is VALID [2018-11-23 12:01:19,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:01:19,239 INFO L256 TraceCheckUtils]: 69: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:01:19,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:01:19,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:01:19,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:01:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:01:19,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:19,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:19,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:19,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:01:19,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:19,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:19,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:01:19,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:01:19,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:01:19,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #175#return; {2141#true} is VALID [2018-11-23 12:01:19,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret23 := main(); {2141#true} is VALID [2018-11-23 12:01:19,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#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; {2141#true} is VALID [2018-11-23 12:01:19,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2141#true} is VALID [2018-11-23 12:01:19,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:19,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2141#true} is VALID [2018-11-23 12:01:19,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:19,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {2141#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {2141#true} is VALID [2018-11-23 12:01:19,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {2141#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:19,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {2141#true} assume !(~a~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:19,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {2141#true} havoc ~i~0;~i~0 := 0; {2141#true} is VALID [2018-11-23 12:01:19,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2141#true} is VALID [2018-11-23 12:01:19,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2141#true} is VALID [2018-11-23 12:01:19,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2141#true} is VALID [2018-11-23 12:01:19,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {2141#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2141#true} is VALID [2018-11-23 12:01:19,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:19,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 12:01:19,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2141#true} is VALID [2018-11-23 12:01:19,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2141#true} is VALID [2018-11-23 12:01:19,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2141#true} is VALID [2018-11-23 12:01:19,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2141#true} is VALID [2018-11-23 12:01:19,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:19,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 12:01:19,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2141#true} is VALID [2018-11-23 12:01:19,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2141#true} is VALID [2018-11-23 12:01:19,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2141#true} is VALID [2018-11-23 12:01:19,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {2141#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2141#true} is VALID [2018-11-23 12:01:19,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:19,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {2141#true} ~i~0 := 0; {2243#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:19,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {2243#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2243#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:19,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {2243#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2250#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:19,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {2250#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2250#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:19,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {2250#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2257#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:19,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {2257#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2142#false} is VALID [2018-11-23 12:01:19,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2142#false} is VALID [2018-11-23 12:01:19,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2142#false} is VALID [2018-11-23 12:01:19,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2142#false} is VALID [2018-11-23 12:01:19,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {2142#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 51: Hoare triple {2142#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 52: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {2142#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 59: Hoare triple {2142#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 60: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2142#false} is VALID [2018-11-23 12:01:19,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {2142#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2142#false} is VALID [2018-11-23 12:01:19,656 INFO L273 TraceCheckUtils]: 64: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2142#false} is VALID [2018-11-23 12:01:19,656 INFO L273 TraceCheckUtils]: 65: Hoare triple {2142#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2142#false} is VALID [2018-11-23 12:01:19,656 INFO L273 TraceCheckUtils]: 66: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L273 TraceCheckUtils]: 67: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L273 TraceCheckUtils]: 68: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L256 TraceCheckUtils]: 69: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L273 TraceCheckUtils]: 70: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L273 TraceCheckUtils]: 71: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:01:19,657 INFO L273 TraceCheckUtils]: 72: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:01:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 12:01:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 12:01:19,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-11-23 12:01:19,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:19,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:01:19,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:19,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:01:19,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:01:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:01:19,814 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 9 states. [2018-11-23 12:01:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:20,805 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2018-11-23 12:01:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:01:20,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-11-23 12:01:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2018-11-23 12:01:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2018-11-23 12:01:20,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 175 transitions. [2018-11-23 12:01:21,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:21,168 INFO L225 Difference]: With dead ends: 173 [2018-11-23 12:01:21,169 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:01:21,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 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-23 12:01:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:01:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-11-23 12:01:21,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:21,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 98 states. [2018-11-23 12:01:21,309 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 98 states. [2018-11-23 12:01:21,309 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 98 states. [2018-11-23 12:01:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:21,313 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 12:01:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-23 12:01:21,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:21,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:21,314 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 108 states. [2018-11-23 12:01:21,314 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 108 states. [2018-11-23 12:01:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:21,318 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 12:01:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-23 12:01:21,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:21,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:21,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:21,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 12:01:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-23 12:01:21,322 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 73 [2018-11-23 12:01:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:21,322 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-23 12:01:21,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:01:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-23 12:01:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:01:21,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:21,324 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:01:21,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:21,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1977892568, now seen corresponding path program 4 times [2018-11-23 12:01:21,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:21,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:21,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:21,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:21,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 12:01:21,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2981#true} is VALID [2018-11-23 12:01:21,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 12:01:21,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #175#return; {2981#true} is VALID [2018-11-23 12:01:21,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret23 := main(); {2981#true} is VALID [2018-11-23 12:01:21,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#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; {2983#(= main_~a~0 0)} is VALID [2018-11-23 12:01:21,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {2983#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2983#(= main_~a~0 0)} is VALID [2018-11-23 12:01:21,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {2983#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:21,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {2984#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:21,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:21,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {2985#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:21,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:21,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:21,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {2982#false} havoc ~i~0;~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:21,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:21,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 32: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:21,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:21,523 INFO L273 TraceCheckUtils]: 41: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 42: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 46: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:21,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 53: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 54: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 55: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,525 INFO L273 TraceCheckUtils]: 56: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 60: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:21,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:21,527 INFO L273 TraceCheckUtils]: 67: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:21,529 INFO L273 TraceCheckUtils]: 77: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 81: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:21,530 INFO L273 TraceCheckUtils]: 82: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:21,531 INFO L273 TraceCheckUtils]: 87: Hoare triple {2982#false} havoc ~x~0;~x~0 := 0; {2982#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {2982#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2982#false} is VALID [2018-11-23 12:01:21,532 INFO L256 TraceCheckUtils]: 89: Hoare triple {2982#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2982#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 90: Hoare triple {2982#false} ~cond := #in~cond; {2982#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 91: Hoare triple {2982#false} assume 0 == ~cond; {2982#false} is VALID [2018-11-23 12:01:21,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 12:01:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:01:21,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:21,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:21,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:21,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:21,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:22,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2018-11-23 12:01:22,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {2981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2981#true} is VALID [2018-11-23 12:01:22,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2018-11-23 12:01:22,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #175#return; {2981#true} is VALID [2018-11-23 12:01:22,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret23 := main(); {2981#true} is VALID [2018-11-23 12:01:22,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {2981#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; {3006#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:22,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {3006#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3006#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:22,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {3006#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:22,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {2984#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2984#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:22,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:22,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {2985#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2985#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:22,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:22,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {2986#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:22,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2987#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:22,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {2982#false} havoc ~i~0;~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:22,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:22,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:22,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:22,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2982#false} is VALID [2018-11-23 12:01:22,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {2982#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2982#false} is VALID [2018-11-23 12:01:22,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:22,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:22,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:22,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {2982#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 38: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 39: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 41: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:22,013 INFO L273 TraceCheckUtils]: 42: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 44: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 45: Hoare triple {2982#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:22,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 53: Hoare triple {2982#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 54: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 55: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 56: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:22,015 INFO L273 TraceCheckUtils]: 57: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 58: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 59: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 60: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 61: Hoare triple {2982#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 62: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 63: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 64: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:22,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 66: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 67: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 68: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 69: Hoare triple {2982#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 70: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 71: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:22,017 INFO L273 TraceCheckUtils]: 73: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:22,018 INFO L273 TraceCheckUtils]: 74: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:22,018 INFO L273 TraceCheckUtils]: 75: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:22,018 INFO L273 TraceCheckUtils]: 76: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {2982#false} is VALID [2018-11-23 12:01:22,018 INFO L273 TraceCheckUtils]: 77: Hoare triple {2982#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2982#false} is VALID [2018-11-23 12:01:22,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {2982#false} ~i~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:22,019 INFO L273 TraceCheckUtils]: 81: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:22,019 INFO L273 TraceCheckUtils]: 82: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:22,019 INFO L273 TraceCheckUtils]: 83: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L273 TraceCheckUtils]: 84: Hoare triple {2982#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L273 TraceCheckUtils]: 85: Hoare triple {2982#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L273 TraceCheckUtils]: 86: Hoare triple {2982#false} assume !(~i~0 < 100000); {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L273 TraceCheckUtils]: 87: Hoare triple {2982#false} havoc ~x~0;~x~0 := 0; {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L273 TraceCheckUtils]: 88: Hoare triple {2982#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {2982#false} is VALID [2018-11-23 12:01:22,020 INFO L256 TraceCheckUtils]: 89: Hoare triple {2982#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {2982#false} is VALID [2018-11-23 12:01:22,021 INFO L273 TraceCheckUtils]: 90: Hoare triple {2982#false} ~cond := #in~cond; {2982#false} is VALID [2018-11-23 12:01:22,021 INFO L273 TraceCheckUtils]: 91: Hoare triple {2982#false} assume 0 == ~cond; {2982#false} is VALID [2018-11-23 12:01:22,021 INFO L273 TraceCheckUtils]: 92: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2018-11-23 12:01:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:01:22,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:22,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:01:22,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-23 12:01:22,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:22,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:01:22,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:01:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:01:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:22,101 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-11-23 12:01:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:22,674 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-11-23 12:01:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:01:22,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-23 12:01:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 12:01:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 12:01:22,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 12:01:22,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:22,810 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:01:22,810 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:01:22,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:01:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 12:01:22,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:22,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 12:01:22,857 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 12:01:22,857 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 12:01:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:22,861 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-23 12:01:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-23 12:01:22,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:22,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:22,862 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 12:01:22,862 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 12:01:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:22,865 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-23 12:01:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-23 12:01:22,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:22,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:22,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:22,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:01:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-23 12:01:22,869 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 93 [2018-11-23 12:01:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:22,870 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-23 12:01:22,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:01:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-23 12:01:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:01:22,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:22,871 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 12:01:22,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:22,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -102109498, now seen corresponding path program 5 times [2018-11-23 12:01:22,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:22,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:22,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:22,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:23,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {3890#true} call ULTIMATE.init(); {3890#true} is VALID [2018-11-23 12:01:23,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {3890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3890#true} is VALID [2018-11-23 12:01:23,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {3890#true} assume true; {3890#true} is VALID [2018-11-23 12:01:23,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3890#true} {3890#true} #175#return; {3890#true} is VALID [2018-11-23 12:01:23,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {3890#true} call #t~ret23 := main(); {3890#true} is VALID [2018-11-23 12:01:23,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {3890#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; {3892#(= main_~a~0 0)} is VALID [2018-11-23 12:01:23,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {3892#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3892#(= main_~a~0 0)} is VALID [2018-11-23 12:01:23,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {3892#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:23,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {3893#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3893#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:23,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {3893#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:23,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {3894#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3894#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:23,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {3894#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:23,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {3895#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3895#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:23,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {3895#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:23,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {3896#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {3896#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:23,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {3896#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3897#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:23,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {3891#false} havoc ~i~0;~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3891#false} is VALID [2018-11-23 12:01:23,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {3891#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3891#false} is VALID [2018-11-23 12:01:23,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3891#false} is VALID [2018-11-23 12:01:23,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {3891#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3891#false} is VALID [2018-11-23 12:01:23,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3891#false} is VALID [2018-11-23 12:01:23,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {3891#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3891#false} is VALID [2018-11-23 12:01:23,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3891#false} is VALID [2018-11-23 12:01:23,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {3891#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3891#false} is VALID [2018-11-23 12:01:23,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3891#false} is VALID [2018-11-23 12:01:23,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {3891#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3891#false} is VALID [2018-11-23 12:01:23,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3891#false} is VALID [2018-11-23 12:01:23,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {3891#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3891#false} is VALID [2018-11-23 12:01:23,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3891#false} is VALID [2018-11-23 12:01:23,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {3891#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {3891#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {3891#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 42: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3891#false} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {3891#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3891#false} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3891#false} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {3891#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3891#false} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {3891#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 50: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 51: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 53: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,182 INFO L273 TraceCheckUtils]: 58: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 61: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 62: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 63: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 65: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 67: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 68: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 69: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 77: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 78: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 79: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 80: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 82: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 83: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 86: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L273 TraceCheckUtils]: 88: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L273 TraceCheckUtils]: 89: Hoare triple {3891#false} havoc ~x~0;~x~0 := 0; {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L273 TraceCheckUtils]: 90: Hoare triple {3891#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L256 TraceCheckUtils]: 91: Hoare triple {3891#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {3891#false} is VALID [2018-11-23 12:01:23,188 INFO L273 TraceCheckUtils]: 92: Hoare triple {3891#false} ~cond := #in~cond; {3891#false} is VALID [2018-11-23 12:01:23,189 INFO L273 TraceCheckUtils]: 93: Hoare triple {3891#false} assume 0 == ~cond; {3891#false} is VALID [2018-11-23 12:01:23,189 INFO L273 TraceCheckUtils]: 94: Hoare triple {3891#false} assume !false; {3891#false} is VALID [2018-11-23 12:01:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:01:23,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:23,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:23,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:37,058 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:01:37,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:37,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {3890#true} call ULTIMATE.init(); {3890#true} is VALID [2018-11-23 12:01:37,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {3890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3890#true} is VALID [2018-11-23 12:01:37,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {3890#true} assume true; {3890#true} is VALID [2018-11-23 12:01:37,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3890#true} {3890#true} #175#return; {3890#true} is VALID [2018-11-23 12:01:37,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {3890#true} call #t~ret23 := main(); {3890#true} is VALID [2018-11-23 12:01:37,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {3890#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; {3890#true} is VALID [2018-11-23 12:01:37,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {3890#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3890#true} is VALID [2018-11-23 12:01:37,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {3890#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {3890#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {3890#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {3890#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {3890#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {3890#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3890#true} is VALID [2018-11-23 12:01:37,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {3890#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {3890#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {3890#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {3890#true} assume !(~a~0 < 100000); {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {3890#true} havoc ~i~0;~i~0 := 0; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {3890#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3890#true} is VALID [2018-11-23 12:01:37,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {3890#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {3890#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {3890#true} assume !(~i~0 < 100000); {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {3890#true} ~i~0 := 0; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {3890#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3890#true} is VALID [2018-11-23 12:01:37,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {3890#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {3890#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {3890#true} assume !(~i~0 < 100000); {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {3890#true} ~i~0 := 0; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {3890#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3890#true} is VALID [2018-11-23 12:01:37,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {3890#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3890#true} is VALID [2018-11-23 12:01:37,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {3890#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {3890#true} is VALID [2018-11-23 12:01:37,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {3890#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3890#true} is VALID [2018-11-23 12:01:37,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {3890#true} assume !(~i~0 < 100000); {3890#true} is VALID [2018-11-23 12:01:37,253 INFO L273 TraceCheckUtils]: 41: Hoare triple {3890#true} ~i~0 := 0; {4024#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,253 INFO L273 TraceCheckUtils]: 42: Hoare triple {4024#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4024#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {4024#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {4031#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4031#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {4031#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4038#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {4038#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4038#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,276 INFO L273 TraceCheckUtils]: 47: Hoare triple {4038#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4045#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,289 INFO L273 TraceCheckUtils]: 48: Hoare triple {4045#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,289 INFO L273 TraceCheckUtils]: 49: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 54: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 55: Hoare triple {3891#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3891#false} is VALID [2018-11-23 12:01:37,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:37,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:37,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:37,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 62: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {3891#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 66: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:37,292 INFO L273 TraceCheckUtils]: 67: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 68: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 69: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {3891#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 78: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {3891#false} is VALID [2018-11-23 12:01:37,294 INFO L273 TraceCheckUtils]: 79: Hoare triple {3891#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 81: Hoare triple {3891#false} ~i~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 83: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 84: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:37,295 INFO L273 TraceCheckUtils]: 85: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {3891#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {3891#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {3891#false} assume !(~i~0 < 100000); {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {3891#false} havoc ~x~0;~x~0 := 0; {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {3891#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {3891#false} is VALID [2018-11-23 12:01:37,296 INFO L256 TraceCheckUtils]: 91: Hoare triple {3891#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {3891#false} is VALID [2018-11-23 12:01:37,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {3891#false} ~cond := #in~cond; {3891#false} is VALID [2018-11-23 12:01:37,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {3891#false} assume 0 == ~cond; {3891#false} is VALID [2018-11-23 12:01:37,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {3891#false} assume !false; {3891#false} is VALID [2018-11-23 12:01:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-23 12:01:37,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:37,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:01:37,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2018-11-23 12:01:37,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:37,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:01:37,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:37,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:01:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:01:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:37,436 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 12 states. [2018-11-23 12:01:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,273 INFO L93 Difference]: Finished difference Result 213 states and 242 transitions. [2018-11-23 12:01:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:01:38,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2018-11-23 12:01:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2018-11-23 12:01:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2018-11-23 12:01:38,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 197 transitions. [2018-11-23 12:01:38,472 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-23 12:01:38,476 INFO L225 Difference]: With dead ends: 213 [2018-11-23 12:01:38,476 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:01:38,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:01:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2018-11-23 12:01:39,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:39,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 120 states. [2018-11-23 12:01:39,039 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 120 states. [2018-11-23 12:01:39,039 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 120 states. [2018-11-23 12:01:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,044 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-11-23 12:01:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-23 12:01:39,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:39,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:39,045 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 130 states. [2018-11-23 12:01:39,045 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 130 states. [2018-11-23 12:01:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,050 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-11-23 12:01:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-11-23 12:01:39,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:39,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:39,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:39,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:01:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-11-23 12:01:39,055 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 95 [2018-11-23 12:01:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:39,056 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-11-23 12:01:39,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:01:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-11-23 12:01:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:01:39,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:39,058 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 12:01:39,058 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:39,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2145146674, now seen corresponding path program 6 times [2018-11-23 12:01:39,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:39,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:39,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:39,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {4936#true} call ULTIMATE.init(); {4936#true} is VALID [2018-11-23 12:01:39,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {4936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4936#true} is VALID [2018-11-23 12:01:39,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {4936#true} assume true; {4936#true} is VALID [2018-11-23 12:01:39,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4936#true} {4936#true} #175#return; {4936#true} is VALID [2018-11-23 12:01:39,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {4936#true} call #t~ret23 := main(); {4936#true} is VALID [2018-11-23 12:01:39,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {4936#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; {4938#(= main_~a~0 0)} is VALID [2018-11-23 12:01:39,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {4938#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4938#(= main_~a~0 0)} is VALID [2018-11-23 12:01:39,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {4938#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4939#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:39,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {4939#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4939#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:39,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {4939#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4940#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:39,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {4940#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4940#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:39,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {4940#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4941#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:39,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {4941#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4941#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:39,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {4941#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4942#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:39,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {4942#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4942#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:39,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {4942#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4943#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:39,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {4943#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {4943#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:39,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {4943#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4944#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:39,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {4944#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {4937#false} havoc ~i~0;~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4937#false} is VALID [2018-11-23 12:01:39,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {4937#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4937#false} is VALID [2018-11-23 12:01:39,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4937#false} is VALID [2018-11-23 12:01:39,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {4937#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4937#false} is VALID [2018-11-23 12:01:39,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4937#false} is VALID [2018-11-23 12:01:39,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {4937#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4937#false} is VALID [2018-11-23 12:01:39,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4937#false} is VALID [2018-11-23 12:01:39,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {4937#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4937#false} is VALID [2018-11-23 12:01:39,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4937#false} is VALID [2018-11-23 12:01:39,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {4937#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4937#false} is VALID [2018-11-23 12:01:39,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4937#false} is VALID [2018-11-23 12:01:39,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {4937#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4937#false} is VALID [2018-11-23 12:01:39,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4937#false} is VALID [2018-11-23 12:01:39,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {4937#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4937#false} is VALID [2018-11-23 12:01:39,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4937#false} is VALID [2018-11-23 12:01:39,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {4937#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4937#false} is VALID [2018-11-23 12:01:39,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,305 INFO L273 TraceCheckUtils]: 40: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4937#false} is VALID [2018-11-23 12:01:39,305 INFO L273 TraceCheckUtils]: 41: Hoare triple {4937#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4937#false} is VALID [2018-11-23 12:01:39,306 INFO L273 TraceCheckUtils]: 42: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4937#false} is VALID [2018-11-23 12:01:39,306 INFO L273 TraceCheckUtils]: 43: Hoare triple {4937#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4937#false} is VALID [2018-11-23 12:01:39,306 INFO L273 TraceCheckUtils]: 44: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4937#false} is VALID [2018-11-23 12:01:39,306 INFO L273 TraceCheckUtils]: 45: Hoare triple {4937#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4937#false} is VALID [2018-11-23 12:01:39,307 INFO L273 TraceCheckUtils]: 46: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4937#false} is VALID [2018-11-23 12:01:39,307 INFO L273 TraceCheckUtils]: 47: Hoare triple {4937#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4937#false} is VALID [2018-11-23 12:01:39,307 INFO L273 TraceCheckUtils]: 48: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,307 INFO L273 TraceCheckUtils]: 49: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,307 INFO L273 TraceCheckUtils]: 50: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4937#false} is VALID [2018-11-23 12:01:39,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {4937#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4937#false} is VALID [2018-11-23 12:01:39,308 INFO L273 TraceCheckUtils]: 52: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4937#false} is VALID [2018-11-23 12:01:39,308 INFO L273 TraceCheckUtils]: 53: Hoare triple {4937#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4937#false} is VALID [2018-11-23 12:01:39,308 INFO L273 TraceCheckUtils]: 54: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4937#false} is VALID [2018-11-23 12:01:39,308 INFO L273 TraceCheckUtils]: 55: Hoare triple {4937#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4937#false} is VALID [2018-11-23 12:01:39,309 INFO L273 TraceCheckUtils]: 56: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4937#false} is VALID [2018-11-23 12:01:39,309 INFO L273 TraceCheckUtils]: 57: Hoare triple {4937#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4937#false} is VALID [2018-11-23 12:01:39,309 INFO L273 TraceCheckUtils]: 58: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,309 INFO L273 TraceCheckUtils]: 59: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,309 INFO L273 TraceCheckUtils]: 60: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4937#false} is VALID [2018-11-23 12:01:39,310 INFO L273 TraceCheckUtils]: 61: Hoare triple {4937#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4937#false} is VALID [2018-11-23 12:01:39,310 INFO L273 TraceCheckUtils]: 62: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4937#false} is VALID [2018-11-23 12:01:39,310 INFO L273 TraceCheckUtils]: 63: Hoare triple {4937#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4937#false} is VALID [2018-11-23 12:01:39,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4937#false} is VALID [2018-11-23 12:01:39,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {4937#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4937#false} is VALID [2018-11-23 12:01:39,311 INFO L273 TraceCheckUtils]: 66: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {4937#false} is VALID [2018-11-23 12:01:39,311 INFO L273 TraceCheckUtils]: 67: Hoare triple {4937#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4937#false} is VALID [2018-11-23 12:01:39,311 INFO L273 TraceCheckUtils]: 68: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,311 INFO L273 TraceCheckUtils]: 69: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:39,312 INFO L273 TraceCheckUtils]: 71: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:39,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:39,312 INFO L273 TraceCheckUtils]: 73: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:39,312 INFO L273 TraceCheckUtils]: 74: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:39,313 INFO L273 TraceCheckUtils]: 75: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:39,313 INFO L273 TraceCheckUtils]: 76: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:39,313 INFO L273 TraceCheckUtils]: 77: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:39,313 INFO L273 TraceCheckUtils]: 78: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,313 INFO L273 TraceCheckUtils]: 79: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,314 INFO L273 TraceCheckUtils]: 80: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:39,314 INFO L273 TraceCheckUtils]: 81: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:39,314 INFO L273 TraceCheckUtils]: 82: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:39,314 INFO L273 TraceCheckUtils]: 83: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:39,314 INFO L273 TraceCheckUtils]: 84: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:39,315 INFO L273 TraceCheckUtils]: 85: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:39,315 INFO L273 TraceCheckUtils]: 86: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:39,315 INFO L273 TraceCheckUtils]: 87: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:39,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,315 INFO L273 TraceCheckUtils]: 89: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,316 INFO L273 TraceCheckUtils]: 90: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:39,316 INFO L273 TraceCheckUtils]: 91: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:39,316 INFO L273 TraceCheckUtils]: 92: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:39,316 INFO L273 TraceCheckUtils]: 93: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:39,316 INFO L273 TraceCheckUtils]: 94: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:39,317 INFO L273 TraceCheckUtils]: 95: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:39,317 INFO L273 TraceCheckUtils]: 96: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:39,317 INFO L273 TraceCheckUtils]: 97: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:39,317 INFO L273 TraceCheckUtils]: 98: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,318 INFO L273 TraceCheckUtils]: 99: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,318 INFO L273 TraceCheckUtils]: 100: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:39,318 INFO L273 TraceCheckUtils]: 101: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:39,318 INFO L273 TraceCheckUtils]: 102: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:39,318 INFO L273 TraceCheckUtils]: 103: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:39,319 INFO L273 TraceCheckUtils]: 104: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:39,319 INFO L273 TraceCheckUtils]: 105: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:39,319 INFO L273 TraceCheckUtils]: 106: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:39,319 INFO L273 TraceCheckUtils]: 107: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:39,319 INFO L273 TraceCheckUtils]: 108: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:39,320 INFO L273 TraceCheckUtils]: 109: Hoare triple {4937#false} havoc ~x~0;~x~0 := 0; {4937#false} is VALID [2018-11-23 12:01:39,320 INFO L273 TraceCheckUtils]: 110: Hoare triple {4937#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {4937#false} is VALID [2018-11-23 12:01:39,320 INFO L256 TraceCheckUtils]: 111: Hoare triple {4937#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {4937#false} is VALID [2018-11-23 12:01:39,320 INFO L273 TraceCheckUtils]: 112: Hoare triple {4937#false} ~cond := #in~cond; {4937#false} is VALID [2018-11-23 12:01:39,320 INFO L273 TraceCheckUtils]: 113: Hoare triple {4937#false} assume 0 == ~cond; {4937#false} is VALID [2018-11-23 12:01:39,321 INFO L273 TraceCheckUtils]: 114: Hoare triple {4937#false} assume !false; {4937#false} is VALID [2018-11-23 12:01:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:01:39,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:39,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:39,353 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:40,355 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:01:40,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:40,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:40,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {4936#true} call ULTIMATE.init(); {4936#true} is VALID [2018-11-23 12:01:40,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {4936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4936#true} is VALID [2018-11-23 12:01:40,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {4936#true} assume true; {4936#true} is VALID [2018-11-23 12:01:40,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4936#true} {4936#true} #175#return; {4936#true} is VALID [2018-11-23 12:01:40,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {4936#true} call #t~ret23 := main(); {4936#true} is VALID [2018-11-23 12:01:40,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {4936#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; {4936#true} is VALID [2018-11-23 12:01:40,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {4936#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {4936#true} is VALID [2018-11-23 12:01:40,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {4936#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4936#true} is VALID [2018-11-23 12:01:40,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {4936#true} assume !(~a~0 < 100000); {4936#true} is VALID [2018-11-23 12:01:40,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {4936#true} havoc ~i~0;~i~0 := 0; {4936#true} is VALID [2018-11-23 12:01:40,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4936#true} is VALID [2018-11-23 12:01:40,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {4936#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4936#true} is VALID [2018-11-23 12:01:40,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4936#true} is VALID [2018-11-23 12:01:40,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {4936#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4936#true} is VALID [2018-11-23 12:01:40,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4936#true} is VALID [2018-11-23 12:01:40,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {4936#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4936#true} is VALID [2018-11-23 12:01:40,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4936#true} is VALID [2018-11-23 12:01:40,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {4936#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4936#true} is VALID [2018-11-23 12:01:40,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {4936#true} assume !(~i~0 < 100000); {4936#true} is VALID [2018-11-23 12:01:40,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {4936#true} ~i~0 := 0; {4936#true} is VALID [2018-11-23 12:01:40,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4936#true} is VALID [2018-11-23 12:01:40,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {4936#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4936#true} is VALID [2018-11-23 12:01:40,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4936#true} is VALID [2018-11-23 12:01:40,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {4936#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4936#true} is VALID [2018-11-23 12:01:40,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4936#true} is VALID [2018-11-23 12:01:40,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {4936#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4936#true} is VALID [2018-11-23 12:01:40,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {4936#true} is VALID [2018-11-23 12:01:40,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {4936#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4936#true} is VALID [2018-11-23 12:01:40,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {4936#true} assume !(~i~0 < 100000); {4936#true} is VALID [2018-11-23 12:01:40,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {4936#true} ~i~0 := 0; {4936#true} is VALID [2018-11-23 12:01:40,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4936#true} is VALID [2018-11-23 12:01:40,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {4936#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4936#true} is VALID [2018-11-23 12:01:40,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4936#true} is VALID [2018-11-23 12:01:40,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {4936#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4936#true} is VALID [2018-11-23 12:01:40,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4936#true} is VALID [2018-11-23 12:01:40,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {4936#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4936#true} is VALID [2018-11-23 12:01:40,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {4936#true} is VALID [2018-11-23 12:01:40,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {4936#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4936#true} is VALID [2018-11-23 12:01:40,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {4936#true} assume !(~i~0 < 100000); {4936#true} is VALID [2018-11-23 12:01:40,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {4936#true} ~i~0 := 0; {4936#true} is VALID [2018-11-23 12:01:40,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4936#true} is VALID [2018-11-23 12:01:40,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {4936#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4936#true} is VALID [2018-11-23 12:01:40,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4936#true} is VALID [2018-11-23 12:01:40,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {4936#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4936#true} is VALID [2018-11-23 12:01:40,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4936#true} is VALID [2018-11-23 12:01:40,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {4936#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4936#true} is VALID [2018-11-23 12:01:40,646 INFO L273 TraceCheckUtils]: 56: Hoare triple {4936#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {4936#true} is VALID [2018-11-23 12:01:40,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {4936#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4936#true} is VALID [2018-11-23 12:01:40,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {4936#true} assume !(~i~0 < 100000); {4936#true} is VALID [2018-11-23 12:01:40,651 INFO L273 TraceCheckUtils]: 59: Hoare triple {4936#true} ~i~0 := 0; {5125#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:40,651 INFO L273 TraceCheckUtils]: 60: Hoare triple {5125#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5125#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:40,656 INFO L273 TraceCheckUtils]: 61: Hoare triple {5125#(<= main_~i~0 0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5132#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:40,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {5132#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5132#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:40,657 INFO L273 TraceCheckUtils]: 63: Hoare triple {5132#(<= main_~i~0 1)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5139#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:40,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {5139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5139#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:40,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {5139#(<= main_~i~0 2)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5146#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:40,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {5146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {5146#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:40,659 INFO L273 TraceCheckUtils]: 67: Hoare triple {5146#(<= main_~i~0 3)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5153#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:40,659 INFO L273 TraceCheckUtils]: 68: Hoare triple {5153#(<= main_~i~0 4)} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:40,659 INFO L273 TraceCheckUtils]: 69: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:40,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:40,660 INFO L273 TraceCheckUtils]: 71: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:40,660 INFO L273 TraceCheckUtils]: 72: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:40,660 INFO L273 TraceCheckUtils]: 73: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:40,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:40,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:40,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {4937#false} is VALID [2018-11-23 12:01:40,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {4937#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4937#false} is VALID [2018-11-23 12:01:40,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:40,662 INFO L273 TraceCheckUtils]: 79: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:40,662 INFO L273 TraceCheckUtils]: 80: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:40,662 INFO L273 TraceCheckUtils]: 81: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 82: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 83: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 84: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 85: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 86: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {4937#false} is VALID [2018-11-23 12:01:40,663 INFO L273 TraceCheckUtils]: 87: Hoare triple {4937#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 88: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 89: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 90: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 91: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 92: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 93: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:40,664 INFO L273 TraceCheckUtils]: 94: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 95: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 96: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 97: Hoare triple {4937#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {4937#false} ~i~0 := 0; {4937#false} is VALID [2018-11-23 12:01:40,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 101: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 102: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 103: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 104: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 105: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 106: Hoare triple {4937#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {4937#false} is VALID [2018-11-23 12:01:40,666 INFO L273 TraceCheckUtils]: 107: Hoare triple {4937#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L273 TraceCheckUtils]: 108: Hoare triple {4937#false} assume !(~i~0 < 100000); {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L273 TraceCheckUtils]: 109: Hoare triple {4937#false} havoc ~x~0;~x~0 := 0; {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L273 TraceCheckUtils]: 110: Hoare triple {4937#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L256 TraceCheckUtils]: 111: Hoare triple {4937#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L273 TraceCheckUtils]: 112: Hoare triple {4937#false} ~cond := #in~cond; {4937#false} is VALID [2018-11-23 12:01:40,667 INFO L273 TraceCheckUtils]: 113: Hoare triple {4937#false} assume 0 == ~cond; {4937#false} is VALID [2018-11-23 12:01:40,668 INFO L273 TraceCheckUtils]: 114: Hoare triple {4937#false} assume !false; {4937#false} is VALID [2018-11-23 12:01:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-23 12:01:40,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:40,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 12:01:40,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-11-23 12:01:40,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:40,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:01:40,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:01:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:01:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:40,801 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 14 states. [2018-11-23 12:01:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,952 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2018-11-23 12:01:41,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:01:41,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-11-23 12:01:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 217 transitions. [2018-11-23 12:01:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 217 transitions. [2018-11-23 12:01:41,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 217 transitions. [2018-11-23 12:01:42,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:42,597 INFO L225 Difference]: With dead ends: 251 [2018-11-23 12:01:42,597 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:01:42,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 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-23 12:01:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:01:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2018-11-23 12:01:42,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:42,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 140 states. [2018-11-23 12:01:42,678 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 140 states. [2018-11-23 12:01:42,678 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 140 states. [2018-11-23 12:01:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:42,690 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-23 12:01:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-23 12:01:42,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:42,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:42,691 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 150 states. [2018-11-23 12:01:42,691 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 150 states. [2018-11-23 12:01:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:42,695 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-23 12:01:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-23 12:01:42,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:42,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:42,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:42,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 12:01:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-23 12:01:42,699 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 115 [2018-11-23 12:01:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:42,700 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-23 12:01:42,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:01:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-23 12:01:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 12:01:42,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:42,701 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 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] [2018-11-23 12:01:42,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:42,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1240531358, now seen corresponding path program 7 times [2018-11-23 12:01:42,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:42,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:42,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:43,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {6171#true} call ULTIMATE.init(); {6171#true} is VALID [2018-11-23 12:01:43,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {6171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6171#true} is VALID [2018-11-23 12:01:43,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {6171#true} assume true; {6171#true} is VALID [2018-11-23 12:01:43,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6171#true} {6171#true} #175#return; {6171#true} is VALID [2018-11-23 12:01:43,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {6171#true} call #t~ret23 := main(); {6171#true} is VALID [2018-11-23 12:01:43,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {6171#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; {6173#(= main_~a~0 0)} is VALID [2018-11-23 12:01:43,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {6173#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6173#(= main_~a~0 0)} is VALID [2018-11-23 12:01:43,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {6173#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6174#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:43,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {6174#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6174#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:43,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {6174#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6175#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:43,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {6175#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6175#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:43,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {6175#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6176#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:43,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {6176#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6176#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:43,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {6176#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6177#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:43,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {6177#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6177#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:43,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {6177#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6178#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:43,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {6178#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6178#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:43,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {6178#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6179#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:43,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {6179#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6179#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:43,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {6179#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:43,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {6180#(<= main_~a~0 7)} assume !(~a~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {6172#false} havoc ~i~0;~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 38: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 39: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 43: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 46: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 47: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 48: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,303 INFO L273 TraceCheckUtils]: 49: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 50: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 51: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 52: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 53: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 55: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,304 INFO L273 TraceCheckUtils]: 57: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 58: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 59: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 60: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 61: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 62: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 65: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,305 INFO L273 TraceCheckUtils]: 66: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 68: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 69: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 71: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 72: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 73: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,306 INFO L273 TraceCheckUtils]: 74: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 75: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 76: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 77: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 78: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 79: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 80: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 81: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 82: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,307 INFO L273 TraceCheckUtils]: 83: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 84: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 85: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 86: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 87: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 88: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 89: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 90: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,308 INFO L273 TraceCheckUtils]: 91: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 92: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 93: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 94: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 95: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 96: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 97: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 98: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 99: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,309 INFO L273 TraceCheckUtils]: 100: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 101: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 102: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 103: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 104: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 105: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 106: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 107: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,310 INFO L273 TraceCheckUtils]: 108: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 109: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 110: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 111: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 112: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 113: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 114: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 115: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 116: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,311 INFO L273 TraceCheckUtils]: 117: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 118: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 119: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 120: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 121: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 122: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 123: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 124: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,312 INFO L273 TraceCheckUtils]: 125: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 126: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 127: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 128: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 129: Hoare triple {6172#false} havoc ~x~0;~x~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 130: Hoare triple {6172#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L256 TraceCheckUtils]: 131: Hoare triple {6172#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 132: Hoare triple {6172#false} ~cond := #in~cond; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 133: Hoare triple {6172#false} assume 0 == ~cond; {6172#false} is VALID [2018-11-23 12:01:43,313 INFO L273 TraceCheckUtils]: 134: Hoare triple {6172#false} assume !false; {6172#false} is VALID [2018-11-23 12:01:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:01:43,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:43,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:43,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:43,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:43,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {6171#true} call ULTIMATE.init(); {6171#true} is VALID [2018-11-23 12:01:43,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {6171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6171#true} is VALID [2018-11-23 12:01:43,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {6171#true} assume true; {6171#true} is VALID [2018-11-23 12:01:43,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6171#true} {6171#true} #175#return; {6171#true} is VALID [2018-11-23 12:01:43,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {6171#true} call #t~ret23 := main(); {6171#true} is VALID [2018-11-23 12:01:43,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {6171#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; {6199#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:43,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {6199#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6199#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:43,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {6199#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6174#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:43,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {6174#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6174#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:43,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {6174#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6175#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:43,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {6175#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6175#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:43,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {6175#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6176#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:43,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {6176#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6176#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:43,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {6176#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6177#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:43,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {6177#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6177#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:43,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {6177#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6178#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:43,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {6178#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6178#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:43,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {6178#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6179#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:43,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {6179#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {6179#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:43,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {6179#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:43,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {6180#(<= main_~a~0 7)} assume !(~a~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {6172#false} havoc ~i~0;~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,600 INFO L273 TraceCheckUtils]: 23: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 29: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {6172#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6172#false} is VALID [2018-11-23 12:01:43,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 33: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {6172#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 48: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,603 INFO L273 TraceCheckUtils]: 49: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 55: Hoare triple {6172#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 56: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 57: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,604 INFO L273 TraceCheckUtils]: 58: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 59: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 60: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 61: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 62: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 63: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 64: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 65: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 66: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {6172#false} is VALID [2018-11-23 12:01:43,605 INFO L273 TraceCheckUtils]: 67: Hoare triple {6172#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 68: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 69: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 70: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 71: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 72: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 73: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 75: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,606 INFO L273 TraceCheckUtils]: 76: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 77: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 78: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 79: Hoare triple {6172#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 80: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 81: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 82: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 83: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 84: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 85: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,607 INFO L273 TraceCheckUtils]: 86: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 87: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 88: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 89: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 90: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 91: Hoare triple {6172#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 92: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 93: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 94: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 96: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 97: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 98: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 99: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 100: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 101: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 102: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 103: Hoare triple {6172#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6172#false} is VALID [2018-11-23 12:01:43,609 INFO L273 TraceCheckUtils]: 104: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 105: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 106: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 107: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 108: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 109: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 110: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 111: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 112: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,610 INFO L273 TraceCheckUtils]: 113: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 114: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 115: Hoare triple {6172#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 116: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 117: Hoare triple {6172#false} ~i~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 118: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 119: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 120: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 121: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 122: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,611 INFO L273 TraceCheckUtils]: 123: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 124: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 125: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 126: Hoare triple {6172#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 127: Hoare triple {6172#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 128: Hoare triple {6172#false} assume !(~i~0 < 100000); {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 129: Hoare triple {6172#false} havoc ~x~0;~x~0 := 0; {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 130: Hoare triple {6172#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L256 TraceCheckUtils]: 131: Hoare triple {6172#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {6172#false} is VALID [2018-11-23 12:01:43,612 INFO L273 TraceCheckUtils]: 132: Hoare triple {6172#false} ~cond := #in~cond; {6172#false} is VALID [2018-11-23 12:01:43,613 INFO L273 TraceCheckUtils]: 133: Hoare triple {6172#false} assume 0 == ~cond; {6172#false} is VALID [2018-11-23 12:01:43,613 INFO L273 TraceCheckUtils]: 134: Hoare triple {6172#false} assume !false; {6172#false} is VALID [2018-11-23 12:01:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:01:43,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:43,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:01:43,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2018-11-23 12:01:43,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:43,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:01:43,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:43,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:01:43,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:01:43,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:01:43,704 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 11 states. [2018-11-23 12:01:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,131 INFO L93 Difference]: Finished difference Result 262 states and 282 transitions. [2018-11-23 12:01:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:01:44,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2018-11-23 12:01:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:01:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-23 12:01:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:01:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-23 12:01:44,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 120 transitions. [2018-11-23 12:01:44,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:44,272 INFO L225 Difference]: With dead ends: 262 [2018-11-23 12:01:44,272 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 12:01:44,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:01:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 12:01:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-11-23 12:01:44,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:44,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 142 states. [2018-11-23 12:01:44,334 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 142 states. [2018-11-23 12:01:44,335 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 142 states. [2018-11-23 12:01:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,338 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-11-23 12:01:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-23 12:01:44,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:44,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:44,339 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 143 states. [2018-11-23 12:01:44,339 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 143 states. [2018-11-23 12:01:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:44,343 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-11-23 12:01:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-23 12:01:44,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:44,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:44,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:44,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 12:01:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-23 12:01:44,347 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 135 [2018-11-23 12:01:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:44,347 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-23 12:01:44,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:01:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-23 12:01:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 12:01:44,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:44,349 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 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] [2018-11-23 12:01:44,350 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:44,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 387533244, now seen corresponding path program 8 times [2018-11-23 12:01:44,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:44,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:45,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {7473#true} call ULTIMATE.init(); {7473#true} is VALID [2018-11-23 12:01:45,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {7473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7473#true} is VALID [2018-11-23 12:01:45,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {7473#true} assume true; {7473#true} is VALID [2018-11-23 12:01:45,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7473#true} {7473#true} #175#return; {7473#true} is VALID [2018-11-23 12:01:45,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {7473#true} call #t~ret23 := main(); {7473#true} is VALID [2018-11-23 12:01:45,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {7473#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; {7475#(= main_~a~0 0)} is VALID [2018-11-23 12:01:45,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {7475#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7475#(= main_~a~0 0)} is VALID [2018-11-23 12:01:45,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {7475#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7476#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:45,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {7476#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7476#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:45,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {7476#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7477#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:45,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {7477#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7477#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:45,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {7477#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7478#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:45,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {7478#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7478#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:45,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {7478#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7479#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:45,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {7479#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7479#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:45,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {7479#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7480#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:45,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {7480#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7480#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:45,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {7480#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7481#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:45,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {7481#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7481#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:45,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {7481#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7482#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:45,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {7482#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7482#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:45,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {7482#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7483#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:45,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {7483#(<= main_~a~0 8)} assume !(~a~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {7474#false} havoc ~i~0;~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 43: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 54: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 73: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 77: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 78: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 84: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 86: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 89: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 90: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,427 INFO L273 TraceCheckUtils]: 91: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 92: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 93: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 94: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 95: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 96: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 98: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,428 INFO L273 TraceCheckUtils]: 99: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 100: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 101: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 102: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 103: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 106: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,429 INFO L273 TraceCheckUtils]: 107: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 108: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 109: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 110: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 111: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 113: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,430 INFO L273 TraceCheckUtils]: 115: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 116: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 117: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 118: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 119: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 120: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 121: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 122: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 123: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,431 INFO L273 TraceCheckUtils]: 124: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 125: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 126: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 127: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 128: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 129: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 130: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 131: Hoare triple {7474#false} havoc ~x~0;~x~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,432 INFO L273 TraceCheckUtils]: 132: Hoare triple {7474#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {7474#false} is VALID [2018-11-23 12:01:45,433 INFO L256 TraceCheckUtils]: 133: Hoare triple {7474#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {7474#false} is VALID [2018-11-23 12:01:45,433 INFO L273 TraceCheckUtils]: 134: Hoare triple {7474#false} ~cond := #in~cond; {7474#false} is VALID [2018-11-23 12:01:45,433 INFO L273 TraceCheckUtils]: 135: Hoare triple {7474#false} assume 0 == ~cond; {7474#false} is VALID [2018-11-23 12:01:45,433 INFO L273 TraceCheckUtils]: 136: Hoare triple {7474#false} assume !false; {7474#false} is VALID [2018-11-23 12:01:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:01:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:45,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:45,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:45,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:45,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:45,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {7473#true} call ULTIMATE.init(); {7473#true} is VALID [2018-11-23 12:01:45,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {7473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7473#true} is VALID [2018-11-23 12:01:45,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {7473#true} assume true; {7473#true} is VALID [2018-11-23 12:01:45,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7473#true} {7473#true} #175#return; {7473#true} is VALID [2018-11-23 12:01:45,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {7473#true} call #t~ret23 := main(); {7473#true} is VALID [2018-11-23 12:01:45,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {7473#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; {7502#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:45,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {7502#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7502#(<= main_~a~0 0)} is VALID [2018-11-23 12:01:45,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {7502#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7476#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:45,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {7476#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7476#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:45,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {7476#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7477#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:45,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {7477#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7477#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:45,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {7477#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7478#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:45,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {7478#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7478#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:45,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {7478#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7479#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:45,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {7479#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7479#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:45,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {7479#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7480#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:45,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {7480#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7480#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:45,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {7480#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7481#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:45,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {7481#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7481#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:45,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {7481#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7482#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:45,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {7482#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {7482#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:45,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {7482#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7483#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:45,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {7483#(<= main_~a~0 8)} assume !(~a~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {7474#false} havoc ~i~0;~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7474#false} is VALID [2018-11-23 12:01:45,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {7474#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7474#false} is VALID [2018-11-23 12:01:45,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 43: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {7474#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 49: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 50: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 53: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 54: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 55: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 57: Hoare triple {7474#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,804 INFO L273 TraceCheckUtils]: 60: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 61: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 62: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 63: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 65: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 69: Hoare triple {7474#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 70: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 71: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 72: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 73: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,806 INFO L273 TraceCheckUtils]: 77: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 81: Hoare triple {7474#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 83: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 84: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,807 INFO L273 TraceCheckUtils]: 85: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 88: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 89: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 90: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 91: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 92: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 93: Hoare triple {7474#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {7474#false} is VALID [2018-11-23 12:01:45,808 INFO L273 TraceCheckUtils]: 94: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 96: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 97: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 98: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 99: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 100: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 101: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,809 INFO L273 TraceCheckUtils]: 102: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 104: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 105: Hoare triple {7474#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 106: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 107: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 108: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 109: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 110: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,810 INFO L273 TraceCheckUtils]: 111: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 112: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 113: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 114: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 115: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 116: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 117: Hoare triple {7474#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 118: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 119: Hoare triple {7474#false} ~i~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,811 INFO L273 TraceCheckUtils]: 120: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 121: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 122: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 123: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 124: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 125: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 126: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 127: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,812 INFO L273 TraceCheckUtils]: 128: Hoare triple {7474#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 129: Hoare triple {7474#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 130: Hoare triple {7474#false} assume !(~i~0 < 100000); {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 131: Hoare triple {7474#false} havoc ~x~0;~x~0 := 0; {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 132: Hoare triple {7474#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L256 TraceCheckUtils]: 133: Hoare triple {7474#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 134: Hoare triple {7474#false} ~cond := #in~cond; {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 135: Hoare triple {7474#false} assume 0 == ~cond; {7474#false} is VALID [2018-11-23 12:01:45,813 INFO L273 TraceCheckUtils]: 136: Hoare triple {7474#false} assume !false; {7474#false} is VALID [2018-11-23 12:01:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:01:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:01:45,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-11-23 12:01:45,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:45,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:01:45,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:45,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:01:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:01:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:45,905 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 12 states. [2018-11-23 12:01:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:46,410 INFO L93 Difference]: Finished difference Result 264 states and 284 transitions. [2018-11-23 12:01:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:01:46,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-11-23 12:01:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 12:01:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2018-11-23 12:01:46,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 122 transitions. [2018-11-23 12:01:46,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:46,974 INFO L225 Difference]: With dead ends: 264 [2018-11-23 12:01:46,974 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:01:46,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:01:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-23 12:01:47,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:47,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 144 states. [2018-11-23 12:01:47,043 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 144 states. [2018-11-23 12:01:47,043 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 144 states. [2018-11-23 12:01:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:47,047 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-11-23 12:01:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-11-23 12:01:47,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:47,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:47,048 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 145 states. [2018-11-23 12:01:47,049 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 145 states. [2018-11-23 12:01:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:47,052 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-11-23 12:01:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-11-23 12:01:47,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:47,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:47,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:47,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 12:01:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-11-23 12:01:47,056 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 137 [2018-11-23 12:01:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:47,057 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-11-23 12:01:47,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:01:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-23 12:01:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:01:47,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:47,058 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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] [2018-11-23 12:01:47,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:47,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:47,059 INFO L82 PathProgramCache]: Analyzing trace with hash 995099226, now seen corresponding path program 9 times [2018-11-23 12:01:47,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:47,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:47,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:47,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:47,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:47,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {8792#true} call ULTIMATE.init(); {8792#true} is VALID [2018-11-23 12:01:47,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {8792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8792#true} is VALID [2018-11-23 12:01:47,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {8792#true} assume true; {8792#true} is VALID [2018-11-23 12:01:47,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8792#true} {8792#true} #175#return; {8792#true} is VALID [2018-11-23 12:01:47,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {8792#true} call #t~ret23 := main(); {8792#true} is VALID [2018-11-23 12:01:47,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {8792#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; {8794#(= main_~a~0 0)} is VALID [2018-11-23 12:01:47,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {8794#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8794#(= main_~a~0 0)} is VALID [2018-11-23 12:01:47,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {8794#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8795#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:47,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {8795#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8795#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:47,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {8795#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8796#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:47,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {8796#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8796#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:47,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {8796#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8797#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:47,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {8797#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8797#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:47,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {8797#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8798#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:47,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {8798#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8798#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:47,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {8798#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8799#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:47,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {8799#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8799#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:47,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {8799#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8800#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:47,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {8800#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8800#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:47,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {8800#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8801#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:47,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {8801#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8801#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:47,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {8801#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8802#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:47,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {8802#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {8802#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:47,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {8802#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8803#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:47,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {8803#(<= main_~a~0 9)} assume !(~a~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {8793#false} havoc ~i~0;~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8793#false} is VALID [2018-11-23 12:01:47,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {8793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8793#false} is VALID [2018-11-23 12:01:47,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8793#false} is VALID [2018-11-23 12:01:47,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {8793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8793#false} is VALID [2018-11-23 12:01:47,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8793#false} is VALID [2018-11-23 12:01:47,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {8793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8793#false} is VALID [2018-11-23 12:01:47,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8793#false} is VALID [2018-11-23 12:01:47,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {8793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8793#false} is VALID [2018-11-23 12:01:47,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8793#false} is VALID [2018-11-23 12:01:47,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {8793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8793#false} is VALID [2018-11-23 12:01:47,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {8793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {8793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {8793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8793#false} is VALID [2018-11-23 12:01:47,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {8793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {8793#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 49: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 50: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 51: Hoare triple {8793#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8793#false} is VALID [2018-11-23 12:01:47,749 INFO L273 TraceCheckUtils]: 53: Hoare triple {8793#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 55: Hoare triple {8793#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 56: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 57: Hoare triple {8793#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 59: Hoare triple {8793#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 60: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 63: Hoare triple {8793#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {8793#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {8793#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {8793#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8793#false} is VALID [2018-11-23 12:01:47,751 INFO L273 TraceCheckUtils]: 70: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 71: Hoare triple {8793#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 72: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 73: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 74: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 76: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:47,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 79: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 80: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 81: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 82: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 84: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 86: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:47,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 88: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 89: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 90: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 93: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 94: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:47,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 97: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 99: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 100: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 101: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 102: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 103: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:47,755 INFO L273 TraceCheckUtils]: 104: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 105: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 106: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 107: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 108: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 109: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 110: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 111: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 112: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:47,756 INFO L273 TraceCheckUtils]: 113: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 114: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 115: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 116: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 117: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 118: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 119: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:47,757 INFO L273 TraceCheckUtils]: 120: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 121: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 122: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 123: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 124: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 125: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:47,758 INFO L273 TraceCheckUtils]: 126: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:47,759 INFO L273 TraceCheckUtils]: 127: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:47,759 INFO L273 TraceCheckUtils]: 128: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:47,759 INFO L273 TraceCheckUtils]: 129: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:47,759 INFO L273 TraceCheckUtils]: 130: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:47,759 INFO L273 TraceCheckUtils]: 131: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L273 TraceCheckUtils]: 132: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L273 TraceCheckUtils]: 133: Hoare triple {8793#false} havoc ~x~0;~x~0 := 0; {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L273 TraceCheckUtils]: 134: Hoare triple {8793#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L256 TraceCheckUtils]: 135: Hoare triple {8793#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L273 TraceCheckUtils]: 136: Hoare triple {8793#false} ~cond := #in~cond; {8793#false} is VALID [2018-11-23 12:01:47,760 INFO L273 TraceCheckUtils]: 137: Hoare triple {8793#false} assume 0 == ~cond; {8793#false} is VALID [2018-11-23 12:01:47,761 INFO L273 TraceCheckUtils]: 138: Hoare triple {8793#false} assume !false; {8793#false} is VALID [2018-11-23 12:01:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:01:47,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:47,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:51,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:01:51,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:51,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:51,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {8792#true} call ULTIMATE.init(); {8792#true} is VALID [2018-11-23 12:01:51,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {8792#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8792#true} is VALID [2018-11-23 12:01:51,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {8792#true} assume true; {8792#true} is VALID [2018-11-23 12:01:51,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8792#true} {8792#true} #175#return; {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {8792#true} call #t~ret23 := main(); {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {8792#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; {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {8792#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {8792#true} is VALID [2018-11-23 12:01:51,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {8792#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {8792#true} assume !(~a~0 < 100000); {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {8792#true} havoc ~i~0;~i~0 := 0; {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {8792#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8792#true} is VALID [2018-11-23 12:01:51,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {8792#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {8792#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {8792#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {8792#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8792#true} is VALID [2018-11-23 12:01:51,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {8792#true} assume !(~i~0 < 100000); {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 37: Hoare triple {8792#true} ~i~0 := 0; {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {8792#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {8792#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8792#true} is VALID [2018-11-23 12:01:51,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {8792#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {8792#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {8792#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {8792#true} assume !(~i~0 < 100000); {8792#true} is VALID [2018-11-23 12:01:51,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {8792#true} ~i~0 := 0; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {8792#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {8792#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8792#true} is VALID [2018-11-23 12:01:51,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {8792#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8792#true} is VALID [2018-11-23 12:01:51,838 INFO L273 TraceCheckUtils]: 56: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8792#true} is VALID [2018-11-23 12:01:51,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {8792#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8792#true} is VALID [2018-11-23 12:01:51,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {8792#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8792#true} is VALID [2018-11-23 12:01:51,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {8792#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8792#true} is VALID [2018-11-23 12:01:51,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {8792#true} assume !(~i~0 < 100000); {8792#true} is VALID [2018-11-23 12:01:51,839 INFO L273 TraceCheckUtils]: 61: Hoare triple {8792#true} ~i~0 := 0; {8990#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:51,839 INFO L273 TraceCheckUtils]: 62: Hoare triple {8990#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8990#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:51,840 INFO L273 TraceCheckUtils]: 63: Hoare triple {8990#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8997#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:51,840 INFO L273 TraceCheckUtils]: 64: Hoare triple {8997#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {8997#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:51,860 INFO L273 TraceCheckUtils]: 65: Hoare triple {8997#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9004#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:51,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {9004#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9004#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:51,889 INFO L273 TraceCheckUtils]: 67: Hoare triple {9004#(<= main_~i~0 2)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9011#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:51,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {9011#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9011#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:51,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {9011#(<= main_~i~0 3)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9018#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:51,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {9018#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {9018#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:51,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {9018#(<= main_~i~0 4)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9025#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:51,893 INFO L273 TraceCheckUtils]: 72: Hoare triple {9025#(<= main_~i~0 5)} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,893 INFO L273 TraceCheckUtils]: 73: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,893 INFO L273 TraceCheckUtils]: 74: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 75: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 76: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 77: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 79: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 80: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:51,894 INFO L273 TraceCheckUtils]: 81: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:51,895 INFO L273 TraceCheckUtils]: 82: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {8793#false} is VALID [2018-11-23 12:01:51,895 INFO L273 TraceCheckUtils]: 83: Hoare triple {8793#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8793#false} is VALID [2018-11-23 12:01:51,895 INFO L273 TraceCheckUtils]: 84: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,895 INFO L273 TraceCheckUtils]: 85: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,896 INFO L273 TraceCheckUtils]: 86: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:51,896 INFO L273 TraceCheckUtils]: 87: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:51,896 INFO L273 TraceCheckUtils]: 88: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:51,896 INFO L273 TraceCheckUtils]: 89: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 90: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 91: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 92: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 93: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 94: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {8793#false} is VALID [2018-11-23 12:01:51,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {8793#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 96: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 97: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 98: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 99: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 100: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 101: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:51,898 INFO L273 TraceCheckUtils]: 102: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 103: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 104: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 105: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 106: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 107: Hoare triple {8793#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 108: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,899 INFO L273 TraceCheckUtils]: 109: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 110: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 111: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 112: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 113: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 114: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 115: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:51,900 INFO L273 TraceCheckUtils]: 116: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 117: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 118: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 119: Hoare triple {8793#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 120: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 121: Hoare triple {8793#false} ~i~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,901 INFO L273 TraceCheckUtils]: 122: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 123: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 124: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 125: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 126: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 127: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 128: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:51,902 INFO L273 TraceCheckUtils]: 129: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 130: Hoare triple {8793#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 131: Hoare triple {8793#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 132: Hoare triple {8793#false} assume !(~i~0 < 100000); {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 133: Hoare triple {8793#false} havoc ~x~0;~x~0 := 0; {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 134: Hoare triple {8793#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L256 TraceCheckUtils]: 135: Hoare triple {8793#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {8793#false} is VALID [2018-11-23 12:01:51,903 INFO L273 TraceCheckUtils]: 136: Hoare triple {8793#false} ~cond := #in~cond; {8793#false} is VALID [2018-11-23 12:01:51,904 INFO L273 TraceCheckUtils]: 137: Hoare triple {8793#false} assume 0 == ~cond; {8793#false} is VALID [2018-11-23 12:01:51,904 INFO L273 TraceCheckUtils]: 138: Hoare triple {8793#false} assume !false; {8793#false} is VALID [2018-11-23 12:01:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-23 12:01:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:51,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 12:01:51,943 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 12:01:51,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:51,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:01:52,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:52,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:01:52,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:01:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:01:52,089 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 18 states. [2018-11-23 12:01:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:53,166 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2018-11-23 12:01:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:01:53,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 12:01:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:01:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 241 transitions. [2018-11-23 12:01:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:01:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 241 transitions. [2018-11-23 12:01:53,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 241 transitions. [2018-11-23 12:01:53,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:53,824 INFO L225 Difference]: With dead ends: 293 [2018-11-23 12:01:53,825 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 12:01:53,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:01:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 12:01:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2018-11-23 12:01:53,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:53,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 164 states. [2018-11-23 12:01:53,917 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 164 states. [2018-11-23 12:01:53,917 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 164 states. [2018-11-23 12:01:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:53,922 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-23 12:01:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-11-23 12:01:53,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:53,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:53,923 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 174 states. [2018-11-23 12:01:53,923 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 174 states. [2018-11-23 12:01:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:53,927 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-23 12:01:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-11-23 12:01:53,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:53,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:53,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:53,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 12:01:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-11-23 12:01:53,932 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 139 [2018-11-23 12:01:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:53,932 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-11-23 12:01:53,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:01:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-11-23 12:01:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 12:01:53,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:53,934 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-23 12:01:53,934 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:53,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:53,935 INFO L82 PathProgramCache]: Analyzing trace with hash 671758534, now seen corresponding path program 10 times [2018-11-23 12:01:53,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:54,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {10250#true} call ULTIMATE.init(); {10250#true} is VALID [2018-11-23 12:01:54,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {10250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10250#true} is VALID [2018-11-23 12:01:54,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {10250#true} assume true; {10250#true} is VALID [2018-11-23 12:01:54,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10250#true} {10250#true} #175#return; {10250#true} is VALID [2018-11-23 12:01:54,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {10250#true} call #t~ret23 := main(); {10250#true} is VALID [2018-11-23 12:01:54,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {10250#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; {10252#(= main_~a~0 0)} is VALID [2018-11-23 12:01:54,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {10252#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10252#(= main_~a~0 0)} is VALID [2018-11-23 12:01:54,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {10252#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10253#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:54,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {10253#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10253#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:54,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {10253#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10254#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:54,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {10254#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10254#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:54,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {10254#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10255#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:54,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {10255#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10255#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:54,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {10255#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10256#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:54,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {10256#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10256#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:54,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {10256#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10257#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:54,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {10257#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10257#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:54,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {10257#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10258#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:54,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {10258#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10258#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:54,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {10258#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10259#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:54,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {10259#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10259#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:54,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {10259#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10260#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:54,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {10260#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10260#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:54,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {10260#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10261#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:54,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {10261#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {10261#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:54,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {10261#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10262#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:54,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {10262#(<= main_~a~0 10)} assume !(~a~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {10251#false} havoc ~i~0;~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10251#false} is VALID [2018-11-23 12:01:54,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {10251#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10251#false} is VALID [2018-11-23 12:01:54,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,623 INFO L273 TraceCheckUtils]: 42: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 52: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10251#false} is VALID [2018-11-23 12:01:54,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {10251#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 56: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 58: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 59: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 60: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 61: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 63: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 64: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 65: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 66: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 67: Hoare triple {10251#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 68: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 69: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 72: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 73: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 74: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 75: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 76: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 77: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 78: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 80: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 81: Hoare triple {10251#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 82: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 83: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 84: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 85: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 86: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 87: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,628 INFO L273 TraceCheckUtils]: 88: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 89: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 90: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 91: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 92: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 93: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 94: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 95: Hoare triple {10251#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 96: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 98: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 99: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 100: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 103: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 104: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 105: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,630 INFO L273 TraceCheckUtils]: 106: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 107: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 108: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 109: Hoare triple {10251#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 110: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 111: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 112: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 113: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,631 INFO L273 TraceCheckUtils]: 114: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 115: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 116: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 117: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 118: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 119: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 120: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 121: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 122: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10251#false} is VALID [2018-11-23 12:01:54,632 INFO L273 TraceCheckUtils]: 123: Hoare triple {10251#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 124: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 125: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 126: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 127: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 128: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 129: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 130: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 131: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,633 INFO L273 TraceCheckUtils]: 132: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 133: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 134: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 135: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 136: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 137: Hoare triple {10251#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 138: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 139: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 140: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,634 INFO L273 TraceCheckUtils]: 141: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 142: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 143: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 144: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 145: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 146: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 147: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 148: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,635 INFO L273 TraceCheckUtils]: 149: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 150: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 151: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 152: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 153: Hoare triple {10251#false} havoc ~x~0;~x~0 := 0; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 154: Hoare triple {10251#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L256 TraceCheckUtils]: 155: Hoare triple {10251#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 156: Hoare triple {10251#false} ~cond := #in~cond; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 157: Hoare triple {10251#false} assume 0 == ~cond; {10251#false} is VALID [2018-11-23 12:01:54,636 INFO L273 TraceCheckUtils]: 158: Hoare triple {10251#false} assume !false; {10251#false} is VALID [2018-11-23 12:01:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 12:01:54,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:54,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:54,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:54,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:54,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:54,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:55,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {10250#true} call ULTIMATE.init(); {10250#true} is VALID [2018-11-23 12:01:55,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {10250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10250#true} is VALID [2018-11-23 12:01:55,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {10250#true} assume true; {10250#true} is VALID [2018-11-23 12:01:55,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10250#true} {10250#true} #175#return; {10250#true} is VALID [2018-11-23 12:01:55,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {10250#true} call #t~ret23 := main(); {10250#true} is VALID [2018-11-23 12:01:55,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {10250#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; {10250#true} is VALID [2018-11-23 12:01:55,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {10250#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {10250#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {10250#true} assume !(~a~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {10250#true} havoc ~i~0;~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 32: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,011 INFO L273 TraceCheckUtils]: 33: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 37: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 38: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {10250#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 43: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 51: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 52: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {10250#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 56: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 57: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,014 INFO L273 TraceCheckUtils]: 59: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 61: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 63: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 64: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 65: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 66: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {10250#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10250#true} is VALID [2018-11-23 12:01:55,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 69: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 71: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 75: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,016 INFO L273 TraceCheckUtils]: 76: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 78: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 79: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 80: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 81: Hoare triple {10250#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 82: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 83: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 84: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 86: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 87: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 89: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 92: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,018 INFO L273 TraceCheckUtils]: 94: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 95: Hoare triple {10250#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 96: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 97: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 98: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 99: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 100: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 102: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,019 INFO L273 TraceCheckUtils]: 103: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 104: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 105: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 106: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 107: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 108: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 109: Hoare triple {10250#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 110: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,020 INFO L273 TraceCheckUtils]: 111: Hoare triple {10250#true} ~i~0 := 0; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 112: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 113: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 114: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 115: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 116: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 117: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 118: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 119: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,021 INFO L273 TraceCheckUtils]: 120: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,022 INFO L273 TraceCheckUtils]: 121: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,022 INFO L273 TraceCheckUtils]: 122: Hoare triple {10250#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {10250#true} is VALID [2018-11-23 12:01:55,022 INFO L273 TraceCheckUtils]: 123: Hoare triple {10250#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10250#true} is VALID [2018-11-23 12:01:55,022 INFO L273 TraceCheckUtils]: 124: Hoare triple {10250#true} assume !(~i~0 < 100000); {10250#true} is VALID [2018-11-23 12:01:55,022 INFO L273 TraceCheckUtils]: 125: Hoare triple {10250#true} ~i~0 := 0; {10641#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:55,023 INFO L273 TraceCheckUtils]: 126: Hoare triple {10641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10641#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:55,023 INFO L273 TraceCheckUtils]: 127: Hoare triple {10641#(<= main_~i~0 0)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10648#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:55,023 INFO L273 TraceCheckUtils]: 128: Hoare triple {10648#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10648#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:55,024 INFO L273 TraceCheckUtils]: 129: Hoare triple {10648#(<= main_~i~0 1)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:55,024 INFO L273 TraceCheckUtils]: 130: Hoare triple {10655#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10655#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:55,025 INFO L273 TraceCheckUtils]: 131: Hoare triple {10655#(<= main_~i~0 2)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10662#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:55,025 INFO L273 TraceCheckUtils]: 132: Hoare triple {10662#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10662#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:55,025 INFO L273 TraceCheckUtils]: 133: Hoare triple {10662#(<= main_~i~0 3)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10669#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:55,026 INFO L273 TraceCheckUtils]: 134: Hoare triple {10669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10669#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:55,026 INFO L273 TraceCheckUtils]: 135: Hoare triple {10669#(<= main_~i~0 4)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10676#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:55,027 INFO L273 TraceCheckUtils]: 136: Hoare triple {10676#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {10676#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:55,028 INFO L273 TraceCheckUtils]: 137: Hoare triple {10676#(<= main_~i~0 5)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:55,028 INFO L273 TraceCheckUtils]: 138: Hoare triple {10683#(<= main_~i~0 6)} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:55,029 INFO L273 TraceCheckUtils]: 139: Hoare triple {10251#false} ~i~0 := 0; {10251#false} is VALID [2018-11-23 12:01:55,029 INFO L273 TraceCheckUtils]: 140: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,029 INFO L273 TraceCheckUtils]: 141: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,029 INFO L273 TraceCheckUtils]: 142: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,029 INFO L273 TraceCheckUtils]: 143: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,030 INFO L273 TraceCheckUtils]: 144: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,030 INFO L273 TraceCheckUtils]: 145: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,030 INFO L273 TraceCheckUtils]: 146: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,030 INFO L273 TraceCheckUtils]: 147: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,030 INFO L273 TraceCheckUtils]: 148: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,031 INFO L273 TraceCheckUtils]: 149: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,031 INFO L273 TraceCheckUtils]: 150: Hoare triple {10251#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {10251#false} is VALID [2018-11-23 12:01:55,031 INFO L273 TraceCheckUtils]: 151: Hoare triple {10251#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {10251#false} is VALID [2018-11-23 12:01:55,031 INFO L273 TraceCheckUtils]: 152: Hoare triple {10251#false} assume !(~i~0 < 100000); {10251#false} is VALID [2018-11-23 12:01:55,031 INFO L273 TraceCheckUtils]: 153: Hoare triple {10251#false} havoc ~x~0;~x~0 := 0; {10251#false} is VALID [2018-11-23 12:01:55,032 INFO L273 TraceCheckUtils]: 154: Hoare triple {10251#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {10251#false} is VALID [2018-11-23 12:01:55,032 INFO L256 TraceCheckUtils]: 155: Hoare triple {10251#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {10251#false} is VALID [2018-11-23 12:01:55,032 INFO L273 TraceCheckUtils]: 156: Hoare triple {10251#false} ~cond := #in~cond; {10251#false} is VALID [2018-11-23 12:01:55,032 INFO L273 TraceCheckUtils]: 157: Hoare triple {10251#false} assume 0 == ~cond; {10251#false} is VALID [2018-11-23 12:01:55,032 INFO L273 TraceCheckUtils]: 158: Hoare triple {10251#false} assume !false; {10251#false} is VALID [2018-11-23 12:01:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-23 12:01:55,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:55,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 12:01:55,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-23 12:01:55,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:55,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:01:55,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:55,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:01:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:01:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:01:55,173 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 20 states. [2018-11-23 12:01:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,123 INFO L93 Difference]: Finished difference Result 331 states and 360 transitions. [2018-11-23 12:01:57,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:01:57,124 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-23 12:01:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:01:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2018-11-23 12:01:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:01:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2018-11-23 12:01:57,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 261 transitions. [2018-11-23 12:01:57,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:57,836 INFO L225 Difference]: With dead ends: 331 [2018-11-23 12:01:57,836 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:01:57,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:01:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:01:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2018-11-23 12:01:57,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:57,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 184 states. [2018-11-23 12:01:57,917 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 184 states. [2018-11-23 12:01:57,918 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 184 states. [2018-11-23 12:01:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,923 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-11-23 12:01:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-23 12:01:57,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,924 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 194 states. [2018-11-23 12:01:57,925 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 194 states. [2018-11-23 12:01:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:57,931 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2018-11-23 12:01:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-23 12:01:57,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:57,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:57,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:57,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 12:01:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-11-23 12:01:57,938 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 159 [2018-11-23 12:01:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:57,938 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-11-23 12:01:57,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:01:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-11-23 12:01:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 12:01:57,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:57,940 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 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] [2018-11-23 12:01:57,941 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 851161394, now seen corresponding path program 11 times [2018-11-23 12:01:57,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:57,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:58,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 12:01:58,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 12:01:58,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 12:01:58,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #175#return; {11897#true} is VALID [2018-11-23 12:01:58,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret23 := main(); {11897#true} is VALID [2018-11-23 12:01:58,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#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; {11899#(= main_~a~0 0)} is VALID [2018-11-23 12:01:58,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {11899#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11899#(= main_~a~0 0)} is VALID [2018-11-23 12:01:58,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {11899#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:58,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11900#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:58,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:58,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11901#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:58,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:58,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11902#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:58,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:58,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11903#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:58,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:58,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11904#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:58,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:58,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11905#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:58,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:58,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11906#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:58,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:58,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11907#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:58,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:58,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11908#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:58,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:58,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {11909#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:58,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:58,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~a~0 11)} assume !(~a~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {11898#false} havoc ~i~0;~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 43: Hoare triple {11898#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 44: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 45: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 46: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 53: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 54: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 55: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 57: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 58: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:01:58,691 INFO L273 TraceCheckUtils]: 59: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 60: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 61: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 62: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 63: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 64: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 65: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 66: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 67: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 70: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 74: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 75: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 76: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 78: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 79: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 80: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 81: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 83: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 86: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 92: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 93: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,695 INFO L273 TraceCheckUtils]: 94: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 95: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 96: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 98: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 101: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 102: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,696 INFO L273 TraceCheckUtils]: 103: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 104: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 105: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 106: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 107: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 108: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 109: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 110: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,697 INFO L273 TraceCheckUtils]: 111: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 112: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 113: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 114: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 115: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 116: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 117: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 118: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 119: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,698 INFO L273 TraceCheckUtils]: 120: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 121: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 122: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 123: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 124: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 125: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 126: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 127: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 128: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,699 INFO L273 TraceCheckUtils]: 129: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 130: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 131: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 132: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 133: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 134: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 135: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 136: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 137: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,700 INFO L273 TraceCheckUtils]: 138: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 139: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 140: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 141: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 142: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 143: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 144: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 145: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,701 INFO L273 TraceCheckUtils]: 146: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 147: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 148: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 149: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 150: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 151: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 152: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 153: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 154: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:01:58,702 INFO L273 TraceCheckUtils]: 155: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 156: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 157: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 158: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 159: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 160: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 161: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 162: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 163: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,703 INFO L273 TraceCheckUtils]: 164: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 165: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 166: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 167: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 168: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 169: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 170: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 171: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 172: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:01:58,704 INFO L273 TraceCheckUtils]: 173: Hoare triple {11898#false} havoc ~x~0;~x~0 := 0; {11898#false} is VALID [2018-11-23 12:01:58,705 INFO L273 TraceCheckUtils]: 174: Hoare triple {11898#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {11898#false} is VALID [2018-11-23 12:01:58,705 INFO L256 TraceCheckUtils]: 175: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {11898#false} is VALID [2018-11-23 12:01:58,705 INFO L273 TraceCheckUtils]: 176: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 12:01:58,705 INFO L273 TraceCheckUtils]: 177: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 12:01:58,705 INFO L273 TraceCheckUtils]: 178: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 12:01:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 12:01:58,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:58,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:58,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:05,866 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:03:05,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:06,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #175#return; {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret23 := main(); {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#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; {11897#true} is VALID [2018-11-23 12:03:06,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {11897#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {11897#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {11897#true} assume !(~a~0 < 100000); {11897#true} is VALID [2018-11-23 12:03:06,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {11897#true} havoc ~i~0;~i~0 := 0; {12001#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:06,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {12001#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12001#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:06,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {12001#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12008#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:06,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {12008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12008#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:06,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {12008#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12015#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:06,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {12015#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12015#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:06,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {12015#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12022#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:06,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {12022#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12022#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:06,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {12022#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12029#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:06,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {12029#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12029#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:06,256 INFO L273 TraceCheckUtils]: 39: Hoare triple {12029#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12036#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:06,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {12036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12036#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:06,257 INFO L273 TraceCheckUtils]: 41: Hoare triple {12036#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12043#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:06,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {12043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {12043#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:06,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {12043#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12050#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 44: Hoare triple {12050#(<= main_~i~0 7)} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,259 INFO L273 TraceCheckUtils]: 50: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,261 INFO L273 TraceCheckUtils]: 57: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {11898#false} is VALID [2018-11-23 12:03:06,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {11898#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11898#false} is VALID [2018-11-23 12:03:06,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 74: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 75: Hoare triple {11898#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 76: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 81: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 82: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 88: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 89: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 90: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 91: Hoare triple {11898#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 96: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 97: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 99: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 101: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,266 INFO L273 TraceCheckUtils]: 104: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 105: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 106: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 107: Hoare triple {11898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 108: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 109: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 110: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 111: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 112: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 114: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 117: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 118: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 119: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 120: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,268 INFO L273 TraceCheckUtils]: 121: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 122: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 123: Hoare triple {11898#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 124: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 125: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 126: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 127: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 128: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 129: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,269 INFO L273 TraceCheckUtils]: 130: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 131: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 132: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 133: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 134: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 135: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 136: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 137: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 138: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {11898#false} is VALID [2018-11-23 12:03:06,270 INFO L273 TraceCheckUtils]: 139: Hoare triple {11898#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 140: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 141: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 142: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 143: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 144: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 145: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 146: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 147: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,271 INFO L273 TraceCheckUtils]: 148: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 149: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 150: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 151: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 152: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 153: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 154: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 155: Hoare triple {11898#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 156: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,272 INFO L273 TraceCheckUtils]: 157: Hoare triple {11898#false} ~i~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 158: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 159: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 160: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 161: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 162: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 163: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 164: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,273 INFO L273 TraceCheckUtils]: 165: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 166: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 167: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 168: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 169: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 170: Hoare triple {11898#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 171: Hoare triple {11898#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 172: Hoare triple {11898#false} assume !(~i~0 < 100000); {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 173: Hoare triple {11898#false} havoc ~x~0;~x~0 := 0; {11898#false} is VALID [2018-11-23 12:03:06,274 INFO L273 TraceCheckUtils]: 174: Hoare triple {11898#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {11898#false} is VALID [2018-11-23 12:03:06,275 INFO L256 TraceCheckUtils]: 175: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {11898#false} is VALID [2018-11-23 12:03:06,275 INFO L273 TraceCheckUtils]: 176: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 12:03:06,275 INFO L273 TraceCheckUtils]: 177: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 12:03:06,275 INFO L273 TraceCheckUtils]: 178: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 12:03:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-23 12:03:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:06,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-11-23 12:03:06,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-23 12:03:06,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:06,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:03:06,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:06,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:03:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:03:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:03:06,409 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 22 states. [2018-11-23 12:03:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:08,207 INFO L93 Difference]: Finished difference Result 369 states and 398 transitions. [2018-11-23 12:03:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:03:08,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-23 12:03:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:03:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 281 transitions. [2018-11-23 12:03:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:03:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 281 transitions. [2018-11-23 12:03:08,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 281 transitions. [2018-11-23 12:03:09,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:09,032 INFO L225 Difference]: With dead ends: 369 [2018-11-23 12:03:09,032 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 12:03:09,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:03:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 12:03:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 204. [2018-11-23 12:03:09,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:09,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 204 states. [2018-11-23 12:03:09,119 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 204 states. [2018-11-23 12:03:09,119 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 204 states. [2018-11-23 12:03:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,124 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-11-23 12:03:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 224 transitions. [2018-11-23 12:03:09,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,125 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 214 states. [2018-11-23 12:03:09,125 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 214 states. [2018-11-23 12:03:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,129 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-11-23 12:03:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 224 transitions. [2018-11-23 12:03:09,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:09,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:09,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:09,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 12:03:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-11-23 12:03:09,134 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 179 [2018-11-23 12:03:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:09,134 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-11-23 12:03:09,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:03:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-11-23 12:03:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 12:03:09,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:09,136 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-23 12:03:09,136 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:09,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1486056350, now seen corresponding path program 12 times [2018-11-23 12:03:09,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {13733#true} call ULTIMATE.init(); {13733#true} is VALID [2018-11-23 12:03:10,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {13733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13733#true} is VALID [2018-11-23 12:03:10,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {13733#true} assume true; {13733#true} is VALID [2018-11-23 12:03:10,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13733#true} {13733#true} #175#return; {13733#true} is VALID [2018-11-23 12:03:10,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {13733#true} call #t~ret23 := main(); {13733#true} is VALID [2018-11-23 12:03:10,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {13733#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; {13735#(= main_~a~0 0)} is VALID [2018-11-23 12:03:10,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {13735#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13735#(= main_~a~0 0)} is VALID [2018-11-23 12:03:10,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {13735#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13736#(<= main_~a~0 1)} is VALID [2018-11-23 12:03:10,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {13736#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13736#(<= main_~a~0 1)} is VALID [2018-11-23 12:03:10,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {13736#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13737#(<= main_~a~0 2)} is VALID [2018-11-23 12:03:10,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {13737#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13737#(<= main_~a~0 2)} is VALID [2018-11-23 12:03:10,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {13737#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13738#(<= main_~a~0 3)} is VALID [2018-11-23 12:03:10,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {13738#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13738#(<= main_~a~0 3)} is VALID [2018-11-23 12:03:10,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {13738#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13739#(<= main_~a~0 4)} is VALID [2018-11-23 12:03:10,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {13739#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13739#(<= main_~a~0 4)} is VALID [2018-11-23 12:03:10,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {13739#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13740#(<= main_~a~0 5)} is VALID [2018-11-23 12:03:10,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {13740#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13740#(<= main_~a~0 5)} is VALID [2018-11-23 12:03:10,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {13740#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13741#(<= main_~a~0 6)} is VALID [2018-11-23 12:03:10,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {13741#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13741#(<= main_~a~0 6)} is VALID [2018-11-23 12:03:10,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {13741#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13742#(<= main_~a~0 7)} is VALID [2018-11-23 12:03:10,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {13742#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13742#(<= main_~a~0 7)} is VALID [2018-11-23 12:03:10,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {13742#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13743#(<= main_~a~0 8)} is VALID [2018-11-23 12:03:10,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {13743#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13743#(<= main_~a~0 8)} is VALID [2018-11-23 12:03:10,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {13743#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13744#(<= main_~a~0 9)} is VALID [2018-11-23 12:03:10,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {13744#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13744#(<= main_~a~0 9)} is VALID [2018-11-23 12:03:10,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {13744#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13745#(<= main_~a~0 10)} is VALID [2018-11-23 12:03:10,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {13745#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13745#(<= main_~a~0 10)} is VALID [2018-11-23 12:03:10,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {13745#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13746#(<= main_~a~0 11)} is VALID [2018-11-23 12:03:10,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {13746#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {13746#(<= main_~a~0 11)} is VALID [2018-11-23 12:03:10,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {13746#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13747#(<= main_~a~0 12)} is VALID [2018-11-23 12:03:10,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {13747#(<= main_~a~0 12)} assume !(~a~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {13734#false} havoc ~i~0;~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 42: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,162 INFO L273 TraceCheckUtils]: 45: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13734#false} is VALID [2018-11-23 12:03:10,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {13734#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13734#false} is VALID [2018-11-23 12:03:10,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,163 INFO L273 TraceCheckUtils]: 50: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 52: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 58: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 59: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 60: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 65: Hoare triple {13734#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 66: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 67: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 68: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 69: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 70: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 74: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 75: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 76: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 77: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 78: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,167 INFO L273 TraceCheckUtils]: 82: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 83: Hoare triple {13734#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 84: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 85: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 86: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 88: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 89: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 91: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 92: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 93: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 94: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 95: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 96: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 97: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 98: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,169 INFO L273 TraceCheckUtils]: 99: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 100: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 101: Hoare triple {13734#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 102: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 103: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 104: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 107: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 108: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 109: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 110: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,171 INFO L273 TraceCheckUtils]: 111: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 112: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 113: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 114: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 115: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 116: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,172 INFO L273 TraceCheckUtils]: 117: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 118: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 119: Hoare triple {13734#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 120: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 121: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 122: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 123: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,173 INFO L273 TraceCheckUtils]: 124: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 125: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 126: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 127: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 128: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 129: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,174 INFO L273 TraceCheckUtils]: 130: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 131: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 132: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 133: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 134: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 135: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 136: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13734#false} is VALID [2018-11-23 12:03:10,175 INFO L273 TraceCheckUtils]: 137: Hoare triple {13734#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 138: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 139: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 140: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 141: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 142: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 143: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 144: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 145: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,176 INFO L273 TraceCheckUtils]: 146: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 147: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 148: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 149: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 150: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 151: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 152: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 153: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 154: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13734#false} is VALID [2018-11-23 12:03:10,177 INFO L273 TraceCheckUtils]: 155: Hoare triple {13734#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 156: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 157: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 158: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 159: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 160: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 161: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 162: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 163: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,178 INFO L273 TraceCheckUtils]: 164: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 165: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 166: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 167: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 168: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 169: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 170: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 171: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 172: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {13734#false} is VALID [2018-11-23 12:03:10,179 INFO L273 TraceCheckUtils]: 173: Hoare triple {13734#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 174: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 175: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 176: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 177: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 178: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 179: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 180: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 181: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,180 INFO L273 TraceCheckUtils]: 182: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 183: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 184: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 185: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 186: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 187: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 188: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 189: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 190: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:10,181 INFO L273 TraceCheckUtils]: 191: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 192: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 193: Hoare triple {13734#false} havoc ~x~0;~x~0 := 0; {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 194: Hoare triple {13734#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L256 TraceCheckUtils]: 195: Hoare triple {13734#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 196: Hoare triple {13734#false} ~cond := #in~cond; {13734#false} is VALID [2018-11-23 12:03:10,182 INFO L273 TraceCheckUtils]: 197: Hoare triple {13734#false} assume 0 == ~cond; {13734#false} is VALID [2018-11-23 12:03:10,183 INFO L273 TraceCheckUtils]: 198: Hoare triple {13734#false} assume !false; {13734#false} is VALID [2018-11-23 12:03:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-23 12:03:10,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:10,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:55,664 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:03:55,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:55,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:56,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {13733#true} call ULTIMATE.init(); {13733#true} is VALID [2018-11-23 12:03:56,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {13733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13733#true} is VALID [2018-11-23 12:03:56,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {13733#true} assume true; {13733#true} is VALID [2018-11-23 12:03:56,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13733#true} {13733#true} #175#return; {13733#true} is VALID [2018-11-23 12:03:56,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {13733#true} call #t~ret23 := main(); {13733#true} is VALID [2018-11-23 12:03:56,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {13733#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; {13733#true} is VALID [2018-11-23 12:03:56,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 27: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {13733#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13733#true} is VALID [2018-11-23 12:03:56,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {13733#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {13733#true} assume !(~a~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {13733#true} havoc ~i~0;~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 46: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {13733#true} is VALID [2018-11-23 12:03:56,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {13733#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 52: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 53: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 54: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 57: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 61: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 62: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13733#true} is VALID [2018-11-23 12:03:56,044 INFO L273 TraceCheckUtils]: 63: Hoare triple {13733#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13733#true} is VALID [2018-11-23 12:03:56,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {13943#(< main_~i~0 100000)} is VALID [2018-11-23 12:03:56,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {13943#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13947#(<= main_~i~0 100000)} is VALID [2018-11-23 12:03:56,045 INFO L273 TraceCheckUtils]: 66: Hoare triple {13947#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 67: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 68: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 69: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 70: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 71: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 72: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 73: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 74: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,046 INFO L273 TraceCheckUtils]: 75: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 76: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 77: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 78: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 79: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 81: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 82: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 83: Hoare triple {13733#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13733#true} is VALID [2018-11-23 12:03:56,047 INFO L273 TraceCheckUtils]: 84: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 85: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 86: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 87: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 88: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 89: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 94: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 95: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 96: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 97: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 98: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 99: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 100: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {13733#true} is VALID [2018-11-23 12:03:56,049 INFO L273 TraceCheckUtils]: 101: Hoare triple {13733#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 102: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 103: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 104: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 105: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 106: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 107: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 108: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 109: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,050 INFO L273 TraceCheckUtils]: 110: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 111: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 112: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 113: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 114: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 115: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 116: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 117: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 118: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13733#true} is VALID [2018-11-23 12:03:56,051 INFO L273 TraceCheckUtils]: 119: Hoare triple {13733#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 120: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 121: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 122: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 123: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 124: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 125: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 126: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 127: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,052 INFO L273 TraceCheckUtils]: 128: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 129: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 130: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 131: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 132: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 133: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 134: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 135: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 136: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {13733#true} is VALID [2018-11-23 12:03:56,053 INFO L273 TraceCheckUtils]: 137: Hoare triple {13733#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 138: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 139: Hoare triple {13733#true} ~i~0 := 0; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 140: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 141: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 142: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 143: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 144: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 145: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,054 INFO L273 TraceCheckUtils]: 146: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 147: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 148: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 149: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 150: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 151: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 152: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 153: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 154: Hoare triple {13733#true} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {13733#true} is VALID [2018-11-23 12:03:56,055 INFO L273 TraceCheckUtils]: 155: Hoare triple {13733#true} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13733#true} is VALID [2018-11-23 12:03:56,056 INFO L273 TraceCheckUtils]: 156: Hoare triple {13733#true} assume !(~i~0 < 100000); {13733#true} is VALID [2018-11-23 12:03:56,056 INFO L273 TraceCheckUtils]: 157: Hoare triple {13733#true} ~i~0 := 0; {14224#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:56,056 INFO L273 TraceCheckUtils]: 158: Hoare triple {14224#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14224#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:56,058 INFO L273 TraceCheckUtils]: 159: Hoare triple {14224#(<= main_~i~0 0)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14231#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:56,058 INFO L273 TraceCheckUtils]: 160: Hoare triple {14231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14231#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:56,058 INFO L273 TraceCheckUtils]: 161: Hoare triple {14231#(<= main_~i~0 1)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14238#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:56,059 INFO L273 TraceCheckUtils]: 162: Hoare triple {14238#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14238#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:56,060 INFO L273 TraceCheckUtils]: 163: Hoare triple {14238#(<= main_~i~0 2)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14245#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:56,060 INFO L273 TraceCheckUtils]: 164: Hoare triple {14245#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14245#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:56,062 INFO L273 TraceCheckUtils]: 165: Hoare triple {14245#(<= main_~i~0 3)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14252#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:56,062 INFO L273 TraceCheckUtils]: 166: Hoare triple {14252#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14252#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:56,063 INFO L273 TraceCheckUtils]: 167: Hoare triple {14252#(<= main_~i~0 4)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14259#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:56,063 INFO L273 TraceCheckUtils]: 168: Hoare triple {14259#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14259#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:56,064 INFO L273 TraceCheckUtils]: 169: Hoare triple {14259#(<= main_~i~0 5)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14266#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:56,064 INFO L273 TraceCheckUtils]: 170: Hoare triple {14266#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14266#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:56,064 INFO L273 TraceCheckUtils]: 171: Hoare triple {14266#(<= main_~i~0 6)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14273#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:56,065 INFO L273 TraceCheckUtils]: 172: Hoare triple {14273#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {14273#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:56,065 INFO L273 TraceCheckUtils]: 173: Hoare triple {14273#(<= main_~i~0 7)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {14280#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:56,065 INFO L273 TraceCheckUtils]: 174: Hoare triple {14280#(<= main_~i~0 8)} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:56,066 INFO L273 TraceCheckUtils]: 175: Hoare triple {13734#false} ~i~0 := 0; {13734#false} is VALID [2018-11-23 12:03:56,066 INFO L273 TraceCheckUtils]: 176: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,066 INFO L273 TraceCheckUtils]: 177: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,066 INFO L273 TraceCheckUtils]: 178: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,066 INFO L273 TraceCheckUtils]: 179: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 180: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 181: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 182: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 183: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 184: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,067 INFO L273 TraceCheckUtils]: 185: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,068 INFO L273 TraceCheckUtils]: 186: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,068 INFO L273 TraceCheckUtils]: 187: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,068 INFO L273 TraceCheckUtils]: 188: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,068 INFO L273 TraceCheckUtils]: 189: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,068 INFO L273 TraceCheckUtils]: 190: Hoare triple {13734#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {13734#false} is VALID [2018-11-23 12:03:56,069 INFO L273 TraceCheckUtils]: 191: Hoare triple {13734#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {13734#false} is VALID [2018-11-23 12:03:56,069 INFO L273 TraceCheckUtils]: 192: Hoare triple {13734#false} assume !(~i~0 < 100000); {13734#false} is VALID [2018-11-23 12:03:56,069 INFO L273 TraceCheckUtils]: 193: Hoare triple {13734#false} havoc ~x~0;~x~0 := 0; {13734#false} is VALID [2018-11-23 12:03:56,069 INFO L273 TraceCheckUtils]: 194: Hoare triple {13734#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {13734#false} is VALID [2018-11-23 12:03:56,069 INFO L256 TraceCheckUtils]: 195: Hoare triple {13734#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {13734#false} is VALID [2018-11-23 12:03:56,070 INFO L273 TraceCheckUtils]: 196: Hoare triple {13734#false} ~cond := #in~cond; {13734#false} is VALID [2018-11-23 12:03:56,070 INFO L273 TraceCheckUtils]: 197: Hoare triple {13734#false} assume 0 == ~cond; {13734#false} is VALID [2018-11-23 12:03:56,070 INFO L273 TraceCheckUtils]: 198: Hoare triple {13734#false} assume !false; {13734#false} is VALID [2018-11-23 12:03:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-11-23 12:03:56,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:56,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-11-23 12:03:56,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 199 [2018-11-23 12:03:56,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:56,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:03:56,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:56,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:03:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:03:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:56,249 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 26 states. [2018-11-23 12:03:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:58,888 INFO L93 Difference]: Finished difference Result 416 states and 454 transitions. [2018-11-23 12:03:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:03:58,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 199 [2018-11-23 12:03:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 319 transitions. [2018-11-23 12:03:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:03:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 319 transitions. [2018-11-23 12:03:58,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 319 transitions. [2018-11-23 12:03:59,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:59,274 INFO L225 Difference]: With dead ends: 416 [2018-11-23 12:03:59,274 INFO L226 Difference]: Without dead ends: 243 [2018-11-23 12:03:59,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:03:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-23 12:03:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-11-23 12:03:59,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:59,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 242 states. [2018-11-23 12:03:59,490 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 242 states. [2018-11-23 12:03:59,491 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 242 states. [2018-11-23 12:03:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:59,497 INFO L93 Difference]: Finished difference Result 243 states and 253 transitions. [2018-11-23 12:03:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 253 transitions. [2018-11-23 12:03:59,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:59,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:59,498 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 243 states. [2018-11-23 12:03:59,498 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 243 states. [2018-11-23 12:03:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:59,503 INFO L93 Difference]: Finished difference Result 243 states and 253 transitions. [2018-11-23 12:03:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 253 transitions. [2018-11-23 12:03:59,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:59,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:59,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:59,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-23 12:03:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 252 transitions. [2018-11-23 12:03:59,509 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 252 transitions. Word has length 199 [2018-11-23 12:03:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:59,510 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 252 transitions. [2018-11-23 12:03:59,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:03:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 252 transitions. [2018-11-23 12:03:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-23 12:03:59,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:59,512 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-23 12:03:59,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:59,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1988209448, now seen corresponding path program 13 times [2018-11-23 12:03:59,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:59,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:59,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {15823#true} call ULTIMATE.init(); {15823#true} is VALID [2018-11-23 12:03:59,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {15823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15823#true} is VALID [2018-11-23 12:03:59,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {15823#true} assume true; {15823#true} is VALID [2018-11-23 12:03:59,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15823#true} {15823#true} #175#return; {15823#true} is VALID [2018-11-23 12:03:59,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {15823#true} call #t~ret23 := main(); {15823#true} is VALID [2018-11-23 12:03:59,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {15823#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; {15825#(= main_~a~0 0)} is VALID [2018-11-23 12:03:59,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {15825#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15825#(= main_~a~0 0)} is VALID [2018-11-23 12:03:59,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {15825#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15826#(<= main_~a~0 1)} is VALID [2018-11-23 12:03:59,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {15826#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15826#(<= main_~a~0 1)} is VALID [2018-11-23 12:03:59,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {15826#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15827#(<= main_~a~0 2)} is VALID [2018-11-23 12:03:59,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {15827#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15827#(<= main_~a~0 2)} is VALID [2018-11-23 12:03:59,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {15827#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15828#(<= main_~a~0 3)} is VALID [2018-11-23 12:03:59,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {15828#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15828#(<= main_~a~0 3)} is VALID [2018-11-23 12:03:59,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {15828#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15829#(<= main_~a~0 4)} is VALID [2018-11-23 12:03:59,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {15829#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15829#(<= main_~a~0 4)} is VALID [2018-11-23 12:03:59,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {15829#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15830#(<= main_~a~0 5)} is VALID [2018-11-23 12:03:59,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {15830#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15830#(<= main_~a~0 5)} is VALID [2018-11-23 12:03:59,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {15830#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15831#(<= main_~a~0 6)} is VALID [2018-11-23 12:03:59,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {15831#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15831#(<= main_~a~0 6)} is VALID [2018-11-23 12:03:59,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {15831#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15832#(<= main_~a~0 7)} is VALID [2018-11-23 12:03:59,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {15832#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15832#(<= main_~a~0 7)} is VALID [2018-11-23 12:03:59,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {15832#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15833#(<= main_~a~0 8)} is VALID [2018-11-23 12:03:59,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {15833#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15833#(<= main_~a~0 8)} is VALID [2018-11-23 12:03:59,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {15833#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15834#(<= main_~a~0 9)} is VALID [2018-11-23 12:03:59,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {15834#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15834#(<= main_~a~0 9)} is VALID [2018-11-23 12:03:59,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {15834#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15835#(<= main_~a~0 10)} is VALID [2018-11-23 12:03:59,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {15835#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15835#(<= main_~a~0 10)} is VALID [2018-11-23 12:03:59,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {15835#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15836#(<= main_~a~0 11)} is VALID [2018-11-23 12:03:59,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {15836#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15836#(<= main_~a~0 11)} is VALID [2018-11-23 12:03:59,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {15836#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15837#(<= main_~a~0 12)} is VALID [2018-11-23 12:03:59,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {15837#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15837#(<= main_~a~0 12)} is VALID [2018-11-23 12:03:59,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {15837#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15838#(<= main_~a~0 13)} is VALID [2018-11-23 12:03:59,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {15838#(<= main_~a~0 13)} assume !(~a~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {15824#false} havoc ~i~0;~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,001 INFO L273 TraceCheckUtils]: 39: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,001 INFO L273 TraceCheckUtils]: 40: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,002 INFO L273 TraceCheckUtils]: 44: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,002 INFO L273 TraceCheckUtils]: 45: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,002 INFO L273 TraceCheckUtils]: 46: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 48: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 51: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,003 INFO L273 TraceCheckUtils]: 52: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 61: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 62: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 63: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 65: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 66: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 67: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 69: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 70: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 71: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 72: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 73: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 74: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 75: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 76: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,006 INFO L273 TraceCheckUtils]: 77: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 78: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 79: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 80: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 82: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 83: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 84: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 85: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,007 INFO L273 TraceCheckUtils]: 86: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 88: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 89: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 90: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 91: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 92: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 93: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 95: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 96: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 97: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 98: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 99: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 100: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 101: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 102: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 104: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 105: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 106: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 107: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 108: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 109: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 110: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 111: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,010 INFO L273 TraceCheckUtils]: 112: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 113: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 114: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 115: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 116: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 117: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 118: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 119: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 120: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,011 INFO L273 TraceCheckUtils]: 121: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 122: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 123: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 124: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 125: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 126: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 127: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 128: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 129: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,012 INFO L273 TraceCheckUtils]: 130: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 131: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 132: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 133: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 134: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 135: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 136: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,013 INFO L273 TraceCheckUtils]: 137: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 138: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 139: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 140: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 141: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 142: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,014 INFO L273 TraceCheckUtils]: 143: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 144: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 145: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 146: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 147: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 148: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,015 INFO L273 TraceCheckUtils]: 149: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,016 INFO L273 TraceCheckUtils]: 150: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,016 INFO L273 TraceCheckUtils]: 151: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,016 INFO L273 TraceCheckUtils]: 152: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,016 INFO L273 TraceCheckUtils]: 153: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,016 INFO L273 TraceCheckUtils]: 154: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 155: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 156: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 157: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 158: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 159: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,017 INFO L273 TraceCheckUtils]: 160: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,018 INFO L273 TraceCheckUtils]: 161: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,018 INFO L273 TraceCheckUtils]: 162: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,018 INFO L273 TraceCheckUtils]: 163: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,018 INFO L273 TraceCheckUtils]: 164: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,018 INFO L273 TraceCheckUtils]: 165: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 166: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 167: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 168: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 169: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 170: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,019 INFO L273 TraceCheckUtils]: 171: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 172: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 173: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 174: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 175: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 176: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,020 INFO L273 TraceCheckUtils]: 177: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,021 INFO L273 TraceCheckUtils]: 178: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,021 INFO L273 TraceCheckUtils]: 179: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,021 INFO L273 TraceCheckUtils]: 180: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,021 INFO L273 TraceCheckUtils]: 181: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,021 INFO L273 TraceCheckUtils]: 182: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 183: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 184: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 185: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 186: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 187: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,022 INFO L273 TraceCheckUtils]: 188: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 189: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 190: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 191: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 192: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 193: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,023 INFO L273 TraceCheckUtils]: 194: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,024 INFO L273 TraceCheckUtils]: 195: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,024 INFO L273 TraceCheckUtils]: 196: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,024 INFO L273 TraceCheckUtils]: 197: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,024 INFO L273 TraceCheckUtils]: 198: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,024 INFO L273 TraceCheckUtils]: 199: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 200: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 201: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 202: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 203: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 204: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 205: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,025 INFO L273 TraceCheckUtils]: 206: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 207: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 208: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 209: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 210: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 211: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,026 INFO L273 TraceCheckUtils]: 212: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 213: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 214: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 215: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 216: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 217: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,027 INFO L273 TraceCheckUtils]: 218: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 219: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 220: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 221: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 222: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 223: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,028 INFO L273 TraceCheckUtils]: 224: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 225: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 226: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 227: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 228: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 229: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,029 INFO L273 TraceCheckUtils]: 230: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L273 TraceCheckUtils]: 231: Hoare triple {15824#false} havoc ~x~0;~x~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L273 TraceCheckUtils]: 232: Hoare triple {15824#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L256 TraceCheckUtils]: 233: Hoare triple {15824#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L273 TraceCheckUtils]: 234: Hoare triple {15824#false} ~cond := #in~cond; {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L273 TraceCheckUtils]: 235: Hoare triple {15824#false} assume 0 == ~cond; {15824#false} is VALID [2018-11-23 12:04:00,030 INFO L273 TraceCheckUtils]: 236: Hoare triple {15824#false} assume !false; {15824#false} is VALID [2018-11-23 12:04:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-23 12:04:00,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:00,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:00,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:00,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {15823#true} call ULTIMATE.init(); {15823#true} is VALID [2018-11-23 12:04:00,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {15823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15823#true} is VALID [2018-11-23 12:04:00,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {15823#true} assume true; {15823#true} is VALID [2018-11-23 12:04:00,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15823#true} {15823#true} #175#return; {15823#true} is VALID [2018-11-23 12:04:00,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {15823#true} call #t~ret23 := main(); {15823#true} is VALID [2018-11-23 12:04:00,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {15823#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; {15857#(<= main_~a~0 0)} is VALID [2018-11-23 12:04:00,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {15857#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15857#(<= main_~a~0 0)} is VALID [2018-11-23 12:04:00,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {15857#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15826#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:00,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {15826#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15826#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:00,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {15826#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15827#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:00,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {15827#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15827#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:00,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {15827#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15828#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:00,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {15828#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15828#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:00,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {15828#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15829#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:00,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {15829#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15829#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:00,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {15829#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15830#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:00,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {15830#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15830#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:00,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {15830#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15831#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:00,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {15831#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15831#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:00,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {15831#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15832#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:00,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {15832#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15832#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:00,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {15832#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15833#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:00,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {15833#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15833#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:00,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {15833#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15834#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:00,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {15834#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15834#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:00,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {15834#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15835#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:00,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {15835#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15835#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:00,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {15835#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15836#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:00,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {15836#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {15836#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:00,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {15836#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15837#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:00,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {15837#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {15837#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:00,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {15837#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15838#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:00,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {15838#(<= main_~a~0 13)} assume !(~a~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {15824#false} havoc ~i~0;~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,482 INFO L273 TraceCheckUtils]: 46: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,482 INFO L273 TraceCheckUtils]: 47: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,482 INFO L273 TraceCheckUtils]: 48: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {15824#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 57: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,483 INFO L273 TraceCheckUtils]: 58: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 60: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 61: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 62: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 68: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 71: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 73: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 75: Hoare triple {15824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15824#false} is VALID [2018-11-23 12:04:00,485 INFO L273 TraceCheckUtils]: 76: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 77: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 78: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 79: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 80: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 81: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 82: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,486 INFO L273 TraceCheckUtils]: 83: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 84: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 85: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 86: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 87: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 88: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,487 INFO L273 TraceCheckUtils]: 89: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,488 INFO L273 TraceCheckUtils]: 90: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,488 INFO L273 TraceCheckUtils]: 91: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,488 INFO L273 TraceCheckUtils]: 92: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,488 INFO L273 TraceCheckUtils]: 93: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,488 INFO L273 TraceCheckUtils]: 94: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 97: Hoare triple {15824#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 98: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,489 INFO L273 TraceCheckUtils]: 100: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 101: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 103: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 104: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 105: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,490 INFO L273 TraceCheckUtils]: 106: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,491 INFO L273 TraceCheckUtils]: 107: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,491 INFO L273 TraceCheckUtils]: 108: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,491 INFO L273 TraceCheckUtils]: 109: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,491 INFO L273 TraceCheckUtils]: 110: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,491 INFO L273 TraceCheckUtils]: 111: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 112: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 113: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 114: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 116: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,493 INFO L273 TraceCheckUtils]: 118: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {15824#false} is VALID [2018-11-23 12:04:00,493 INFO L273 TraceCheckUtils]: 119: Hoare triple {15824#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {15824#false} is VALID [2018-11-23 12:04:00,493 INFO L273 TraceCheckUtils]: 120: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,493 INFO L273 TraceCheckUtils]: 121: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,493 INFO L273 TraceCheckUtils]: 122: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 123: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 124: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 125: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 126: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 127: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,494 INFO L273 TraceCheckUtils]: 128: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 129: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 130: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 131: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 132: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 133: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,495 INFO L273 TraceCheckUtils]: 134: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,496 INFO L273 TraceCheckUtils]: 135: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,496 INFO L273 TraceCheckUtils]: 136: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,496 INFO L273 TraceCheckUtils]: 137: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,496 INFO L273 TraceCheckUtils]: 138: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,496 INFO L273 TraceCheckUtils]: 139: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 140: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 141: Hoare triple {15824#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 142: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 143: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 144: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,497 INFO L273 TraceCheckUtils]: 145: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 146: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 147: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 148: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 149: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 150: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,498 INFO L273 TraceCheckUtils]: 151: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,499 INFO L273 TraceCheckUtils]: 152: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,499 INFO L273 TraceCheckUtils]: 153: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,499 INFO L273 TraceCheckUtils]: 154: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,499 INFO L273 TraceCheckUtils]: 155: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,499 INFO L273 TraceCheckUtils]: 156: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 157: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 158: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 159: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 160: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 161: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,500 INFO L273 TraceCheckUtils]: 162: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 163: Hoare triple {15824#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 164: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 165: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 166: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 167: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,501 INFO L273 TraceCheckUtils]: 168: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 169: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 170: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 171: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 172: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 173: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,502 INFO L273 TraceCheckUtils]: 174: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,503 INFO L273 TraceCheckUtils]: 175: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,503 INFO L273 TraceCheckUtils]: 176: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,503 INFO L273 TraceCheckUtils]: 177: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,503 INFO L273 TraceCheckUtils]: 178: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,503 INFO L273 TraceCheckUtils]: 179: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 180: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 181: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 182: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 183: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 184: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {15824#false} is VALID [2018-11-23 12:04:00,504 INFO L273 TraceCheckUtils]: 185: Hoare triple {15824#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15824#false} is VALID [2018-11-23 12:04:00,505 INFO L273 TraceCheckUtils]: 186: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,505 INFO L273 TraceCheckUtils]: 187: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,505 INFO L273 TraceCheckUtils]: 188: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,505 INFO L273 TraceCheckUtils]: 189: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,505 INFO L273 TraceCheckUtils]: 190: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,506 INFO L273 TraceCheckUtils]: 191: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,506 INFO L273 TraceCheckUtils]: 192: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,506 INFO L273 TraceCheckUtils]: 193: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,506 INFO L273 TraceCheckUtils]: 194: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,506 INFO L273 TraceCheckUtils]: 195: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 196: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 197: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 198: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 199: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 200: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,507 INFO L273 TraceCheckUtils]: 201: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 202: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 203: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 204: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 205: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 206: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {15824#false} is VALID [2018-11-23 12:04:00,508 INFO L273 TraceCheckUtils]: 207: Hoare triple {15824#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15824#false} is VALID [2018-11-23 12:04:00,509 INFO L273 TraceCheckUtils]: 208: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,509 INFO L273 TraceCheckUtils]: 209: Hoare triple {15824#false} ~i~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,509 INFO L273 TraceCheckUtils]: 210: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,509 INFO L273 TraceCheckUtils]: 211: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,509 INFO L273 TraceCheckUtils]: 212: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,510 INFO L273 TraceCheckUtils]: 213: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,510 INFO L273 TraceCheckUtils]: 214: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,510 INFO L273 TraceCheckUtils]: 215: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,510 INFO L273 TraceCheckUtils]: 216: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,510 INFO L273 TraceCheckUtils]: 217: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 218: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 219: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 220: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 221: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 222: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 223: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,511 INFO L273 TraceCheckUtils]: 224: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 225: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 226: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 227: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 228: Hoare triple {15824#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 229: Hoare triple {15824#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {15824#false} is VALID [2018-11-23 12:04:00,512 INFO L273 TraceCheckUtils]: 230: Hoare triple {15824#false} assume !(~i~0 < 100000); {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L273 TraceCheckUtils]: 231: Hoare triple {15824#false} havoc ~x~0;~x~0 := 0; {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L273 TraceCheckUtils]: 232: Hoare triple {15824#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L256 TraceCheckUtils]: 233: Hoare triple {15824#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L273 TraceCheckUtils]: 234: Hoare triple {15824#false} ~cond := #in~cond; {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L273 TraceCheckUtils]: 235: Hoare triple {15824#false} assume 0 == ~cond; {15824#false} is VALID [2018-11-23 12:04:00,513 INFO L273 TraceCheckUtils]: 236: Hoare triple {15824#false} assume !false; {15824#false} is VALID [2018-11-23 12:04:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-23 12:04:00,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:00,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:04:00,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 237 [2018-11-23 12:04:00,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:00,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:04:00,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:00,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:04:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:04:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:00,854 INFO L87 Difference]: Start difference. First operand 242 states and 252 transitions. Second operand 17 states. [2018-11-23 12:04:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:01,684 INFO L93 Difference]: Finished difference Result 454 states and 474 transitions. [2018-11-23 12:04:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:04:01,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 237 [2018-11-23 12:04:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2018-11-23 12:04:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2018-11-23 12:04:01,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 132 transitions. [2018-11-23 12:04:01,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:01,811 INFO L225 Difference]: With dead ends: 454 [2018-11-23 12:04:01,811 INFO L226 Difference]: Without dead ends: 245 [2018-11-23 12:04:01,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-23 12:04:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2018-11-23 12:04:01,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:01,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand 244 states. [2018-11-23 12:04:01,947 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 244 states. [2018-11-23 12:04:01,947 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 244 states. [2018-11-23 12:04:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:01,953 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-11-23 12:04:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-11-23 12:04:01,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:01,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:01,954 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 245 states. [2018-11-23 12:04:01,954 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 245 states. [2018-11-23 12:04:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:01,959 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-11-23 12:04:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-11-23 12:04:01,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:01,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:01,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:01,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-23 12:04:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 254 transitions. [2018-11-23 12:04:01,966 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 254 transitions. Word has length 237 [2018-11-23 12:04:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:01,967 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 254 transitions. [2018-11-23 12:04:01,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:04:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 254 transitions. [2018-11-23 12:04:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-23 12:04:01,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:01,969 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-23 12:04:01,969 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:01,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1376672138, now seen corresponding path program 14 times [2018-11-23 12:04:01,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:01,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:01,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:02,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {18082#true} call ULTIMATE.init(); {18082#true} is VALID [2018-11-23 12:04:02,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {18082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18082#true} is VALID [2018-11-23 12:04:02,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {18082#true} assume true; {18082#true} is VALID [2018-11-23 12:04:02,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18082#true} {18082#true} #175#return; {18082#true} is VALID [2018-11-23 12:04:02,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {18082#true} call #t~ret23 := main(); {18082#true} is VALID [2018-11-23 12:04:02,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {18082#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; {18084#(= main_~a~0 0)} is VALID [2018-11-23 12:04:02,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {18084#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18084#(= main_~a~0 0)} is VALID [2018-11-23 12:04:02,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {18084#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18085#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:02,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {18085#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18085#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:02,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {18085#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18086#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:02,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {18086#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18086#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:02,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {18086#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18087#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:02,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {18087#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18087#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:02,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {18087#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18088#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:02,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {18088#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18088#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:02,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {18088#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18089#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:02,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {18089#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18089#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:02,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {18089#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18090#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:02,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {18090#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18090#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:02,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {18090#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18091#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:02,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {18091#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18091#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:02,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {18091#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18092#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:02,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {18092#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18092#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:02,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {18092#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18093#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:02,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {18093#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18093#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:02,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {18093#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18094#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:02,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {18094#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18094#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:02,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {18094#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18095#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:02,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {18095#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18095#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:02,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {18095#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18096#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:02,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {18096#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18096#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:02,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {18096#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18097#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:02,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {18097#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18097#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:02,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {18097#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18098#(<= main_~a~0 14)} is VALID [2018-11-23 12:04:02,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {18098#(<= main_~a~0 14)} assume !(~a~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {18083#false} havoc ~i~0;~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 65: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,301 INFO L273 TraceCheckUtils]: 66: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 67: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 68: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 69: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 70: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 71: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 72: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 73: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,302 INFO L273 TraceCheckUtils]: 75: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 77: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 78: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 81: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 82: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 83: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,303 INFO L273 TraceCheckUtils]: 84: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 85: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 87: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 88: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 89: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 90: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 91: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 92: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 93: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,304 INFO L273 TraceCheckUtils]: 94: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 95: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 96: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 97: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 98: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 99: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 100: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 101: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 102: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,305 INFO L273 TraceCheckUtils]: 103: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 104: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 105: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 106: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 107: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 108: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 109: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 110: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 111: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,306 INFO L273 TraceCheckUtils]: 112: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 113: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 114: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 115: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 116: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 117: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 118: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 119: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 120: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,307 INFO L273 TraceCheckUtils]: 121: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 122: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 123: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 124: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 125: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 126: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 127: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 128: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 129: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,308 INFO L273 TraceCheckUtils]: 130: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 131: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 132: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 133: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 134: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 135: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 136: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 137: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 138: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 139: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,309 INFO L273 TraceCheckUtils]: 140: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 141: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 142: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 143: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 144: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 145: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 146: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 147: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 148: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,310 INFO L273 TraceCheckUtils]: 149: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 150: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 151: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 152: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 153: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 154: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 155: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 156: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 157: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 158: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,311 INFO L273 TraceCheckUtils]: 159: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 160: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 161: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 162: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 163: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 164: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 165: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 166: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 167: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,312 INFO L273 TraceCheckUtils]: 168: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 169: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 170: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 171: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 172: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 173: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 174: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 175: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 176: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,313 INFO L273 TraceCheckUtils]: 177: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 178: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 179: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 180: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 181: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 182: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 183: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 184: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 185: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 186: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,314 INFO L273 TraceCheckUtils]: 187: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 188: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 189: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 190: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 191: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 192: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 193: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 194: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 195: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,315 INFO L273 TraceCheckUtils]: 196: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 197: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 198: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 199: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 200: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 201: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 202: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 203: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 204: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 205: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,316 INFO L273 TraceCheckUtils]: 206: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 207: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 208: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 209: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 210: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 211: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 212: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 213: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 214: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,317 INFO L273 TraceCheckUtils]: 215: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 216: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 217: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 218: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 219: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 220: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 221: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 222: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 223: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 224: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,318 INFO L273 TraceCheckUtils]: 225: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 226: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 227: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 228: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 229: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 230: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 231: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 232: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 233: Hoare triple {18083#false} havoc ~x~0;~x~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,319 INFO L273 TraceCheckUtils]: 234: Hoare triple {18083#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {18083#false} is VALID [2018-11-23 12:04:02,320 INFO L256 TraceCheckUtils]: 235: Hoare triple {18083#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {18083#false} is VALID [2018-11-23 12:04:02,320 INFO L273 TraceCheckUtils]: 236: Hoare triple {18083#false} ~cond := #in~cond; {18083#false} is VALID [2018-11-23 12:04:02,320 INFO L273 TraceCheckUtils]: 237: Hoare triple {18083#false} assume 0 == ~cond; {18083#false} is VALID [2018-11-23 12:04:02,320 INFO L273 TraceCheckUtils]: 238: Hoare triple {18083#false} assume !false; {18083#false} is VALID [2018-11-23 12:04:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-23 12:04:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:02,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:02,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:02,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:02,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:02,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:02,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {18082#true} call ULTIMATE.init(); {18082#true} is VALID [2018-11-23 12:04:02,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {18082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18082#true} is VALID [2018-11-23 12:04:02,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {18082#true} assume true; {18082#true} is VALID [2018-11-23 12:04:02,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18082#true} {18082#true} #175#return; {18082#true} is VALID [2018-11-23 12:04:02,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {18082#true} call #t~ret23 := main(); {18082#true} is VALID [2018-11-23 12:04:02,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {18082#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; {18117#(<= main_~a~0 0)} is VALID [2018-11-23 12:04:02,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {18117#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18117#(<= main_~a~0 0)} is VALID [2018-11-23 12:04:02,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {18117#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18085#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:02,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {18085#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18085#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:02,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {18085#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18086#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:02,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {18086#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18086#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:02,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {18086#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18087#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:02,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {18087#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18087#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:02,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {18087#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18088#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:02,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {18088#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18088#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:02,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {18088#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18089#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:02,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {18089#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18089#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:02,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {18089#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18090#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:02,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {18090#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18090#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:02,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {18090#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18091#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:02,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {18091#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18091#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:02,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {18091#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18092#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:02,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {18092#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18092#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:02,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {18092#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18093#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:02,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {18093#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18093#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:02,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {18093#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18094#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:02,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {18094#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18094#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:02,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {18094#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18095#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:02,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {18095#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {18095#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:02,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {18095#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18096#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:02,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {18096#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18096#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:02,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {18096#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18097#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:02,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {18097#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {18097#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:02,862 INFO L273 TraceCheckUtils]: 33: Hoare triple {18097#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18098#(<= main_~a~0 14)} is VALID [2018-11-23 12:04:02,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {18098#(<= main_~a~0 14)} assume !(~a~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {18083#false} havoc ~i~0;~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,863 INFO L273 TraceCheckUtils]: 37: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,863 INFO L273 TraceCheckUtils]: 38: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 42: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,864 INFO L273 TraceCheckUtils]: 44: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 45: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 46: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 47: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 48: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 49: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,865 INFO L273 TraceCheckUtils]: 50: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 51: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 52: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 53: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 54: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 55: Hoare triple {18083#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 57: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 60: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 61: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 62: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 63: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 64: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 65: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 68: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,867 INFO L273 TraceCheckUtils]: 69: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 70: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 71: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 72: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 73: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 74: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 75: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 76: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 77: Hoare triple {18083#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18083#false} is VALID [2018-11-23 12:04:02,868 INFO L273 TraceCheckUtils]: 78: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 79: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 80: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 81: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 82: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 83: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 84: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 85: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 86: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 87: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,869 INFO L273 TraceCheckUtils]: 88: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 89: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 90: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 91: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 92: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 93: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 94: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 95: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,870 INFO L273 TraceCheckUtils]: 96: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 97: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 98: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 99: Hoare triple {18083#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 100: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 101: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 102: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,871 INFO L273 TraceCheckUtils]: 103: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 104: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 105: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 106: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 107: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 108: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 109: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 110: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 111: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,872 INFO L273 TraceCheckUtils]: 112: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 113: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 114: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 115: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 116: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 117: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 118: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 119: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,873 INFO L273 TraceCheckUtils]: 120: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 121: Hoare triple {18083#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 122: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 123: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 124: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 125: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,874 INFO L273 TraceCheckUtils]: 126: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 127: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 128: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 129: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 130: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 131: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 132: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,875 INFO L273 TraceCheckUtils]: 133: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 134: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 135: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 136: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 137: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 138: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 139: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 140: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 141: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 142: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {18083#false} is VALID [2018-11-23 12:04:02,876 INFO L273 TraceCheckUtils]: 143: Hoare triple {18083#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 144: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 146: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 147: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 148: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 149: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 150: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 151: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,877 INFO L273 TraceCheckUtils]: 152: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 153: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 154: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 155: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 156: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 157: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 158: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 159: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 160: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,878 INFO L273 TraceCheckUtils]: 161: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 162: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 163: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 164: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 165: Hoare triple {18083#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 166: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 167: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 168: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 169: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 170: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,879 INFO L273 TraceCheckUtils]: 171: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 172: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 173: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 174: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 175: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 176: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 177: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 178: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,880 INFO L273 TraceCheckUtils]: 179: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 180: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 181: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 182: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 183: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 184: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,881 INFO L273 TraceCheckUtils]: 185: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 186: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 187: Hoare triple {18083#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 188: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 189: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 190: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 191: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,882 INFO L273 TraceCheckUtils]: 192: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 193: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 194: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 195: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 196: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 197: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 198: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,883 INFO L273 TraceCheckUtils]: 199: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 200: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 201: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 202: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 203: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 204: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 205: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 206: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,884 INFO L273 TraceCheckUtils]: 207: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 208: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 209: Hoare triple {18083#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 210: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 211: Hoare triple {18083#false} ~i~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 212: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 213: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 214: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 215: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 216: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,885 INFO L273 TraceCheckUtils]: 217: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 218: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 219: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 220: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 221: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 222: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 223: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 224: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 225: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,886 INFO L273 TraceCheckUtils]: 226: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 227: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 228: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 229: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 230: Hoare triple {18083#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 231: Hoare triple {18083#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 232: Hoare triple {18083#false} assume !(~i~0 < 100000); {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 233: Hoare triple {18083#false} havoc ~x~0;~x~0 := 0; {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L273 TraceCheckUtils]: 234: Hoare triple {18083#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {18083#false} is VALID [2018-11-23 12:04:02,887 INFO L256 TraceCheckUtils]: 235: Hoare triple {18083#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {18083#false} is VALID [2018-11-23 12:04:02,888 INFO L273 TraceCheckUtils]: 236: Hoare triple {18083#false} ~cond := #in~cond; {18083#false} is VALID [2018-11-23 12:04:02,888 INFO L273 TraceCheckUtils]: 237: Hoare triple {18083#false} assume 0 == ~cond; {18083#false} is VALID [2018-11-23 12:04:02,888 INFO L273 TraceCheckUtils]: 238: Hoare triple {18083#false} assume !false; {18083#false} is VALID [2018-11-23 12:04:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-23 12:04:02,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:04:02,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 239 [2018-11-23 12:04:02,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:02,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:04:03,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:03,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:04:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:04:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:03,013 INFO L87 Difference]: Start difference. First operand 244 states and 254 transitions. Second operand 18 states. [2018-11-23 12:04:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:03,944 INFO L93 Difference]: Finished difference Result 456 states and 476 transitions. [2018-11-23 12:04:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:04:03,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 239 [2018-11-23 12:04:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 12:04:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2018-11-23 12:04:03,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 134 transitions. [2018-11-23 12:04:04,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:04,094 INFO L225 Difference]: With dead ends: 456 [2018-11-23 12:04:04,094 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 12:04:04,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 12:04:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-11-23 12:04:04,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:04,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 246 states. [2018-11-23 12:04:04,216 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 246 states. [2018-11-23 12:04:04,216 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 246 states. [2018-11-23 12:04:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:04,222 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-11-23 12:04:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 257 transitions. [2018-11-23 12:04:04,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:04,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:04,223 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 247 states. [2018-11-23 12:04:04,223 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 247 states. [2018-11-23 12:04:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:04,228 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-11-23 12:04:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 257 transitions. [2018-11-23 12:04:04,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:04,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:04,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:04,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-23 12:04:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 256 transitions. [2018-11-23 12:04:04,235 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 256 transitions. Word has length 239 [2018-11-23 12:04:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:04,236 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 256 transitions. [2018-11-23 12:04:04,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:04:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 256 transitions. [2018-11-23 12:04:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-23 12:04:04,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:04,238 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-23 12:04:04,238 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:04,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2099836780, now seen corresponding path program 15 times [2018-11-23 12:04:04,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:04,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:05,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {20358#true} call ULTIMATE.init(); {20358#true} is VALID [2018-11-23 12:04:05,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {20358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20358#true} is VALID [2018-11-23 12:04:05,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {20358#true} assume true; {20358#true} is VALID [2018-11-23 12:04:05,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20358#true} {20358#true} #175#return; {20358#true} is VALID [2018-11-23 12:04:05,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {20358#true} call #t~ret23 := main(); {20358#true} is VALID [2018-11-23 12:04:05,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {20358#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; {20360#(= main_~a~0 0)} is VALID [2018-11-23 12:04:05,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {20360#(= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20360#(= main_~a~0 0)} is VALID [2018-11-23 12:04:05,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {20360#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20361#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:05,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {20361#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20361#(<= main_~a~0 1)} is VALID [2018-11-23 12:04:05,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {20361#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20362#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:05,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {20362#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20362#(<= main_~a~0 2)} is VALID [2018-11-23 12:04:05,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {20362#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20363#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:05,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {20363#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20363#(<= main_~a~0 3)} is VALID [2018-11-23 12:04:05,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {20363#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20364#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:05,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {20364#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20364#(<= main_~a~0 4)} is VALID [2018-11-23 12:04:05,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {20364#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20365#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:05,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {20365#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20365#(<= main_~a~0 5)} is VALID [2018-11-23 12:04:05,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {20365#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20366#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:05,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {20366#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20366#(<= main_~a~0 6)} is VALID [2018-11-23 12:04:05,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {20366#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20367#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:05,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {20367#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20367#(<= main_~a~0 7)} is VALID [2018-11-23 12:04:05,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {20367#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20368#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:05,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {20368#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20368#(<= main_~a~0 8)} is VALID [2018-11-23 12:04:05,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {20368#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20369#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:05,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {20369#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20369#(<= main_~a~0 9)} is VALID [2018-11-23 12:04:05,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {20369#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20370#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:05,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {20370#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20370#(<= main_~a~0 10)} is VALID [2018-11-23 12:04:05,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {20370#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20371#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:05,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {20371#(<= 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 + 4 * ~a~0, 4);havoc #t~nondet1; {20371#(<= main_~a~0 11)} is VALID [2018-11-23 12:04:05,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {20371#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20372#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:05,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {20372#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {20372#(<= main_~a~0 12)} is VALID [2018-11-23 12:04:05,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {20372#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20373#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:05,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {20373#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {20373#(<= main_~a~0 13)} is VALID [2018-11-23 12:04:05,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {20373#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20374#(<= main_~a~0 14)} is VALID [2018-11-23 12:04:05,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {20374#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {20374#(<= main_~a~0 14)} is VALID [2018-11-23 12:04:05,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {20374#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {20375#(<= main_~a~0 15)} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {20375#(<= main_~a~0 15)} assume !(~a~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {20359#false} havoc ~i~0;~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 46: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 48: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,548 INFO L273 TraceCheckUtils]: 54: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,548 INFO L273 TraceCheckUtils]: 55: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {20359#false} is VALID [2018-11-23 12:04:05,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {20359#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20359#false} is VALID [2018-11-23 12:04:05,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 61: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 62: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 63: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 65: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 66: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 67: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 68: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 69: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 70: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 72: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,550 INFO L273 TraceCheckUtils]: 74: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 75: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 76: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 77: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 78: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {20359#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 80: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 82: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,551 INFO L273 TraceCheckUtils]: 83: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 84: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 85: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 86: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 87: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 88: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 89: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 90: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,552 INFO L273 TraceCheckUtils]: 91: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 92: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 93: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 94: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 95: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 96: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,553 INFO L273 TraceCheckUtils]: 97: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 98: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 99: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 100: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 101: Hoare triple {20359#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 102: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 103: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,554 INFO L273 TraceCheckUtils]: 104: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 105: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 106: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 107: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 108: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 109: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,555 INFO L273 TraceCheckUtils]: 110: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 111: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 112: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 113: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 114: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 115: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 116: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 117: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 118: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,556 INFO L273 TraceCheckUtils]: 119: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 120: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 121: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 122: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem9; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 123: Hoare triple {20359#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 124: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 125: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 126: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 127: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 128: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,557 INFO L273 TraceCheckUtils]: 129: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 130: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 131: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 132: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 133: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 134: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 135: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 136: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 137: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,558 INFO L273 TraceCheckUtils]: 138: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 139: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 140: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 141: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 142: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 143: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 144: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 145: Hoare triple {20359#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 146: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 147: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,559 INFO L273 TraceCheckUtils]: 148: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 149: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 150: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 151: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 152: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 153: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 154: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 155: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 156: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,560 INFO L273 TraceCheckUtils]: 157: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,561 INFO L273 TraceCheckUtils]: 158: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,561 INFO L273 TraceCheckUtils]: 159: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,561 INFO L273 TraceCheckUtils]: 160: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,561 INFO L273 TraceCheckUtils]: 161: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,561 INFO L273 TraceCheckUtils]: 162: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 163: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 164: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 165: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 166: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem13 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem13, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem13; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 167: Hoare triple {20359#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 168: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,562 INFO L273 TraceCheckUtils]: 169: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 170: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 171: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 172: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 173: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 174: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 175: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,563 INFO L273 TraceCheckUtils]: 176: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 177: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 178: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 179: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 180: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 181: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,564 INFO L273 TraceCheckUtils]: 182: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 183: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 184: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 185: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 186: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 187: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 188: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem15 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem15, ~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);havoc #t~mem15; {20359#false} is VALID [2018-11-23 12:04:05,565 INFO L273 TraceCheckUtils]: 189: Hoare triple {20359#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 190: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 191: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 192: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 193: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 194: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 195: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,566 INFO L273 TraceCheckUtils]: 196: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 197: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 198: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 199: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 200: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 201: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 202: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 203: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 204: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,567 INFO L273 TraceCheckUtils]: 205: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 206: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 207: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 208: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 209: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 210: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem17 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem17, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem17; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 211: Hoare triple {20359#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 212: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 213: Hoare triple {20359#false} ~i~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,568 INFO L273 TraceCheckUtils]: 214: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 215: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 216: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 217: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 218: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 219: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 220: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 221: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 222: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 223: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,569 INFO L273 TraceCheckUtils]: 224: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 225: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 226: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 227: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 228: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 229: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 230: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 231: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 232: Hoare triple {20359#false} assume !!(~i~0 < 100000);call #t~mem19 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);call write~int(#t~mem19, ~#a0~0.base, ~#a0~0.offset + 4 * ~i~0, 4);havoc #t~mem19; {20359#false} is VALID [2018-11-23 12:04:05,570 INFO L273 TraceCheckUtils]: 233: Hoare triple {20359#false} #t~post18 := ~i~0;~i~0 := 1 + #t~post18;havoc #t~post18; {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 234: Hoare triple {20359#false} assume !(~i~0 < 100000); {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 235: Hoare triple {20359#false} havoc ~x~0;~x~0 := 0; {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 236: Hoare triple {20359#false} assume !!(~x~0 < 100000);call #t~mem21 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem22 := read~int(~#a0~0.base, ~#a0~0.offset + 4 * ~x~0, 4); {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L256 TraceCheckUtils]: 237: Hoare triple {20359#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 238: Hoare triple {20359#false} ~cond := #in~cond; {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 239: Hoare triple {20359#false} assume 0 == ~cond; {20359#false} is VALID [2018-11-23 12:04:05,571 INFO L273 TraceCheckUtils]: 240: Hoare triple {20359#false} assume !false; {20359#false} is VALID [2018-11-23 12:04:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-11-23 12:04:05,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:05,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:05,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2