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_copy7_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:59:02,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:59:02,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:59:02,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:59:02,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:59:02,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:59:02,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:59:02,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:59:02,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:59:02,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:59:02,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:59:02,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:59:02,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:59:02,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:59:02,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:59:02,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:59:02,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:59:02,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:59:02,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:59:02,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:59:02,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:59:02,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:59:02,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:59:02,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:59:02,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:59:02,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:59:02,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:59:02,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:59:02,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:59:02,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:59:02,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:59:02,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:59:02,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:59:02,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:59:02,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:59:02,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:59:02,336 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 11:59:02,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:59:02,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:59:02,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:59:02,359 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:59:02,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:59:02,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:59:02,360 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:59:02,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:59:02,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:59:02,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:59:02,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:59:02,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:59:02,362 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:59:02,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:59:02,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:59:02,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:59:02,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:59:02,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:59:02,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:59:02,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:59:02,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:59:02,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:59:02,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:59:02,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:59:02,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:59:02,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:59:02,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:59:02,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:59:02,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:59:02,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:59:02,436 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:59:02,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_true-unreach-call_ground.i [2018-11-23 11:59:02,515 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c795159f/9abf0d1e95954262990652eeed7a6cd8/FLAG4cb99329e [2018-11-23 11:59:03,019 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:59:03,020 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_true-unreach-call_ground.i [2018-11-23 11:59:03,027 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c795159f/9abf0d1e95954262990652eeed7a6cd8/FLAG4cb99329e [2018-11-23 11:59:03,334 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c795159f/9abf0d1e95954262990652eeed7a6cd8 [2018-11-23 11:59:03,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:59:03,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:59:03,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:03,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:59:03,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:59:03,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd690e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03, skipping insertion in model container [2018-11-23 11:59:03,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:59:03,391 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:59:03,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:03,624 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:59:03,673 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:03,695 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:59:03,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03 WrapperNode [2018-11-23 11:59:03,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:03,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:03,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:59:03,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:59:03,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:03,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:59:03,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:59:03,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:59:03,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (1/1) ... [2018-11-23 11:59:03,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:59:03,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:59:03,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:59:03,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:59:03,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (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 11:59:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:59:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:59:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:59:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:59:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:59:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:59:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:59:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:59:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:59:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:59:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:59:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:04,959 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:04,960 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 11:59:04,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:04 BoogieIcfgContainer [2018-11-23 11:59:04,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:04,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:59:04,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:59:04,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:59:04,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:59:03" (1/3) ... [2018-11-23 11:59:04,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e778f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:04, skipping insertion in model container [2018-11-23 11:59:04,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:03" (2/3) ... [2018-11-23 11:59:04,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e778f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:04, skipping insertion in model container [2018-11-23 11:59:04,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:04" (3/3) ... [2018-11-23 11:59:04,971 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy7_true-unreach-call_ground.i [2018-11-23 11:59:04,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:59:04,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:59:05,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:59:05,039 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:59:05,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:59:05,041 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:59:05,041 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:59:05,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:59:05,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:59:05,041 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:59:05,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:59:05,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:59:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-23 11:59:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:59:05,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,074 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] [2018-11-23 11:59:05,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2029657296, now seen corresponding path program 1 times [2018-11-23 11:59:05,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:05,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-23 11:59:05,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-23 11:59:05,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-23 11:59:05,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-23 11:59:05,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret19 := main(); {48#true} is VALID [2018-11-23 11:59:05,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#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);havoc ~a~0;~a~0 := 0; {48#true} is VALID [2018-11-23 11:59:05,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-23 11:59:05,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} havoc ~i~0;~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:59:05,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:59:05,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:59:05,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:59:05,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#false} assume !(~i~0 < 100000); {49#false} is VALID [2018-11-23 11:59:05,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 11:59:05,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} ~i~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 11:59:05,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {49#false} havoc ~x~0;~x~0 := 0; {49#false} is VALID [2018-11-23 11:59:05,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {49#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {49#false} is VALID [2018-11-23 11:59:05,285 INFO L256 TraceCheckUtils]: 23: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {49#false} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {49#false} assume 0 == ~cond; {49#false} is VALID [2018-11-23 11:59:05,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-23 11:59:05,291 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 11:59:05,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:05,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:59:05,300 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:59:05,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:59:05,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:59:05,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:59:05,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:59:05,425 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-23 11:59:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,725 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2018-11-23 11:59:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:59:05,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:59:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:59:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:59:05,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 11:59:06,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,576 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:59:06,576 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:59:06,580 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 11:59:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:59:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:59:06,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:59:06,629 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:59:06,629 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:59:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,635 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:59:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:59:06,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,636 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:59:06,636 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:59:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,642 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:59:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:59:06,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 11:59:06,649 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 11:59:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,649 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 11:59:06,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:59:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:59:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:59:06,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,651 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] [2018-11-23 11:59:06,652 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2073025378, now seen corresponding path program 1 times [2018-11-23 11:59:06,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-23 11:59:06,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {294#true} is VALID [2018-11-23 11:59:06,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-23 11:59:06,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #147#return; {294#true} is VALID [2018-11-23 11:59:06,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret19 := main(); {294#true} is VALID [2018-11-23 11:59:06,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#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);havoc ~a~0;~a~0 := 0; {296#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {296#(= main_~a~0 0)} assume !(~a~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#false} havoc ~i~0;~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {295#false} ~i~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {295#false} assume !(~i~0 < 100000); {295#false} is VALID [2018-11-23 11:59:06,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {295#false} havoc ~x~0;~x~0 := 0; {295#false} is VALID [2018-11-23 11:59:06,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {295#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {295#false} is VALID [2018-11-23 11:59:06,774 INFO L256 TraceCheckUtils]: 23: Hoare triple {295#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {295#false} is VALID [2018-11-23 11:59:06,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2018-11-23 11:59:06,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2018-11-23 11:59:06,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-23 11:59:06,777 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 11:59:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:06,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:06,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:59:06,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:07,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:07,004 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-23 11:59:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,237 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 11:59:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:07,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:59:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:59:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:59:07,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 11:59:07,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,456 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:59:07,456 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:59:07,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:59:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 11:59:07,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:07,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 11:59:07,492 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 11:59:07,493 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 11:59:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,496 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:59:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:59:07,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,498 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 11:59:07,498 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 11:59:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,501 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:59:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:59:07,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:07,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:59:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 11:59:07,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2018-11-23 11:59:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 11:59:07,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 11:59:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:59:07,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:07,508 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] [2018-11-23 11:59:07,509 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:07,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -55785284, now seen corresponding path program 1 times [2018-11-23 11:59:07,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:07,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 11:59:07,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {540#true} is VALID [2018-11-23 11:59:07,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 11:59:07,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #147#return; {540#true} is VALID [2018-11-23 11:59:07,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret19 := main(); {540#true} is VALID [2018-11-23 11:59:07,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#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);havoc ~a~0;~a~0 := 0; {540#true} is VALID [2018-11-23 11:59:07,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#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; {540#true} is VALID [2018-11-23 11:59:07,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {540#true} is VALID [2018-11-23 11:59:07,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#true} assume !(~a~0 < 100000); {540#true} is VALID [2018-11-23 11:59:07,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#true} havoc ~i~0;~i~0 := 0; {542#(= main_~i~0 0)} is VALID [2018-11-23 11:59:07,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(= main_~i~0 0)} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {541#false} ~i~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {541#false} assume !(~i~0 < 100000); {541#false} is VALID [2018-11-23 11:59:07,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {541#false} havoc ~x~0;~x~0 := 0; {541#false} is VALID [2018-11-23 11:59:07,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {541#false} is VALID [2018-11-23 11:59:07,619 INFO L256 TraceCheckUtils]: 25: Hoare triple {541#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {541#false} is VALID [2018-11-23 11:59:07,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {541#false} ~cond := #in~cond; {541#false} is VALID [2018-11-23 11:59:07,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {541#false} assume 0 == ~cond; {541#false} is VALID [2018-11-23 11:59:07,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 11:59:07,622 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 11:59:07,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:07,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:07,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:59:07,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:07,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:07,710 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 3 states. [2018-11-23 11:59:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,088 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-23 11:59:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:08,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:59:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 11:59:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 11:59:08,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-23 11:59:08,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,282 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:59:08,283 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:59:08,283 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 11:59:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:59:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-11-23 11:59:08,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 48 states. [2018-11-23 11:59:08,324 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 48 states. [2018-11-23 11:59:08,324 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 48 states. [2018-11-23 11:59:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,327 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:59:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 11:59:08,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,328 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 55 states. [2018-11-23 11:59:08,329 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 55 states. [2018-11-23 11:59:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,332 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:59:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 11:59:08,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:59:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 11:59:08,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 29 [2018-11-23 11:59:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 11:59:08,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:59:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:59:08,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,339 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] [2018-11-23 11:59:08,339 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1132383374, now seen corresponding path program 1 times [2018-11-23 11:59:08,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:08,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 11:59:08,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 11:59:08,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 11:59:08,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #147#return; {842#true} is VALID [2018-11-23 11:59:08,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret19 := main(); {842#true} is VALID [2018-11-23 11:59:08,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#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);havoc ~a~0;~a~0 := 0; {844#(= main_~a~0 0)} is VALID [2018-11-23 11:59:08,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= 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; {844#(= main_~a~0 0)} is VALID [2018-11-23 11:59:08,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:08,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~a~0 1)} assume !(~a~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#false} havoc ~i~0;~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {843#false} is VALID [2018-11-23 11:59:08,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {843#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {843#false} is VALID [2018-11-23 11:59:08,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {843#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {843#false} is VALID [2018-11-23 11:59:08,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {843#false} is VALID [2018-11-23 11:59:08,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {843#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {843#false} is VALID [2018-11-23 11:59:08,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {843#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {843#false} is VALID [2018-11-23 11:59:08,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {843#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {843#false} is VALID [2018-11-23 11:59:08,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {843#false} havoc ~x~0;~x~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {843#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {843#false} is VALID [2018-11-23 11:59:08,511 INFO L256 TraceCheckUtils]: 39: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {843#false} is VALID [2018-11-23 11:59:08,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {843#false} ~cond := #in~cond; {843#false} is VALID [2018-11-23 11:59:08,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {843#false} assume 0 == ~cond; {843#false} is VALID [2018-11-23 11:59:08,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 11:59:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:59:08,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:08,516 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 11:59:08,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:08,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:08,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 11:59:08,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {842#true} is VALID [2018-11-23 11:59:08,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 11:59:08,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #147#return; {842#true} is VALID [2018-11-23 11:59:08,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret19 := main(); {842#true} is VALID [2018-11-23 11:59:08,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#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);havoc ~a~0;~a~0 := 0; {864#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:08,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {864#(<= 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; {864#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:08,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {864#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {845#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:08,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {845#(<= main_~a~0 1)} assume !(~a~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#false} havoc ~i~0;~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {843#false} is VALID [2018-11-23 11:59:08,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {843#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {843#false} is VALID [2018-11-23 11:59:08,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {843#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {843#false} is VALID [2018-11-23 11:59:08,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {843#false} is VALID [2018-11-23 11:59:08,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {843#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {843#false} is VALID [2018-11-23 11:59:08,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {843#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {843#false} is VALID [2018-11-23 11:59:08,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {843#false} ~i~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {843#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; {843#false} is VALID [2018-11-23 11:59:08,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {843#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {843#false} is VALID [2018-11-23 11:59:08,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {843#false} assume !(~i~0 < 100000); {843#false} is VALID [2018-11-23 11:59:08,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {843#false} havoc ~x~0;~x~0 := 0; {843#false} is VALID [2018-11-23 11:59:08,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {843#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {843#false} is VALID [2018-11-23 11:59:08,934 INFO L256 TraceCheckUtils]: 39: Hoare triple {843#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {843#false} is VALID [2018-11-23 11:59:08,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {843#false} ~cond := #in~cond; {843#false} is VALID [2018-11-23 11:59:08,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {843#false} assume 0 == ~cond; {843#false} is VALID [2018-11-23 11:59:08,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 11:59:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:59:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:08,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:59:08,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 11:59:08,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:08,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:59:09,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:09,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:09,141 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-11-23 11:59:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,407 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-11-23 11:59:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:09,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 11:59:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 11:59:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 11:59:09,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-23 11:59:09,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,754 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:59:09,754 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:59:09,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 11:59:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:59:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 11:59:09,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:09,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 11:59:09,809 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 11:59:09,809 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 11:59:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,812 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:59:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:59:09,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,813 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 11:59:09,813 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 11:59:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,816 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:59:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:59:09,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:09,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:59:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-23 11:59:09,820 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2018-11-23 11:59:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:09,821 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-23 11:59:09,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 11:59:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:59:09,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:09,823 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] [2018-11-23 11:59:09,823 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:09,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:09,823 INFO L82 PathProgramCache]: Analyzing trace with hash 165377196, now seen corresponding path program 2 times [2018-11-23 11:59:09,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:09,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-23 11:59:09,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1282#true} is VALID [2018-11-23 11:59:09,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-23 11:59:09,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1282#true} {1282#true} #147#return; {1282#true} is VALID [2018-11-23 11:59:09,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {1282#true} call #t~ret19 := main(); {1282#true} is VALID [2018-11-23 11:59:09,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#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);havoc ~a~0;~a~0 := 0; {1284#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(= 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; {1284#(= main_~a~0 0)} is VALID [2018-11-23 11:59:09,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1285#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(<= 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; {1285#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:09,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {1285#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1286#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:09,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {1283#false} havoc ~i~0;~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {1283#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1283#false} is VALID [2018-11-23 11:59:09,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {1283#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1283#false} is VALID [2018-11-23 11:59:09,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {1283#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1283#false} is VALID [2018-11-23 11:59:09,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {1283#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1283#false} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {1283#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1283#false} is VALID [2018-11-23 11:59:09,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {1283#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1283#false} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:09,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {1283#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1283#false} is VALID [2018-11-23 11:59:09,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:09,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {1283#false} havoc ~x~0;~x~0 := 0; {1283#false} is VALID [2018-11-23 11:59:09,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {1283#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1283#false} is VALID [2018-11-23 11:59:09,985 INFO L256 TraceCheckUtils]: 41: Hoare triple {1283#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {1283#false} is VALID [2018-11-23 11:59:09,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2018-11-23 11:59:09,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2018-11-23 11:59:09,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-23 11:59:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:59:09,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,990 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 11:59:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:10,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:10,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:10,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-23 11:59:10,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1282#true} is VALID [2018-11-23 11:59:10,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-23 11:59:10,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1282#true} {1282#true} #147#return; {1282#true} is VALID [2018-11-23 11:59:10,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1282#true} call #t~ret19 := main(); {1282#true} is VALID [2018-11-23 11:59:10,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#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);havoc ~a~0;~a~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1282#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1282#true} is VALID [2018-11-23 11:59:10,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {1282#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1282#true} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {1282#true} assume !(~a~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#true} havoc ~i~0;~i~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#true} is VALID [2018-11-23 11:59:10,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1282#true} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1282#true} is VALID [2018-11-23 11:59:10,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,189 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1282#true} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#true} ~i~0 := 0; {1282#true} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#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; {1282#true} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1282#true} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#true} assume !(~i~0 < 100000); {1282#true} is VALID [2018-11-23 11:59:10,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#true} ~i~0 := 0; {1383#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:10,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {1383#(<= 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; {1383#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:10,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {1383#(<= main_~i~0 0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1390#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {1283#false} ~i~0 := 0; {1283#false} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {1283#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; {1283#false} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {1283#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1283#false} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {1283#false} assume !(~i~0 < 100000); {1283#false} is VALID [2018-11-23 11:59:10,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {1283#false} havoc ~x~0;~x~0 := 0; {1283#false} is VALID [2018-11-23 11:59:10,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {1283#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1283#false} is VALID [2018-11-23 11:59:10,194 INFO L256 TraceCheckUtils]: 41: Hoare triple {1283#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {1283#false} is VALID [2018-11-23 11:59:10,195 INFO L273 TraceCheckUtils]: 42: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2018-11-23 11:59:10,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2018-11-23 11:59:10,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-23 11:59:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:59:10,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:59:10,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 11:59:10,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:59:10,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:59:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:59:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:10,360 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 7 states. [2018-11-23 11:59:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,926 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-11-23 11:59:10,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:10,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 11:59:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:59:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:59:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:59:10,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-23 11:59:11,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,209 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:59:11,209 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:59:11,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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 11:59:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:59:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-11-23 11:59:11,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 66 states. [2018-11-23 11:59:11,254 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 66 states. [2018-11-23 11:59:11,254 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 66 states. [2018-11-23 11:59:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,257 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-23 11:59:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-11-23 11:59:11,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,258 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 74 states. [2018-11-23 11:59:11,258 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 74 states. [2018-11-23 11:59:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,261 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-23 11:59:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-11-23 11:59:11,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:59:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-11-23 11:59:11,266 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 45 [2018-11-23 11:59:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,266 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-23 11:59:11,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:59:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 11:59:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:59:11,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,268 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-23 11:59:11,268 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash -799866724, now seen corresponding path program 3 times [2018-11-23 11:59:11,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:11,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {1831#true} call ULTIMATE.init(); {1831#true} is VALID [2018-11-23 11:59:11,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {1831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1831#true} is VALID [2018-11-23 11:59:11,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {1831#true} assume true; {1831#true} is VALID [2018-11-23 11:59:11,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1831#true} {1831#true} #147#return; {1831#true} is VALID [2018-11-23 11:59:11,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {1831#true} call #t~ret19 := main(); {1831#true} is VALID [2018-11-23 11:59:11,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {1831#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);havoc ~a~0;~a~0 := 0; {1833#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {1833#(= 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; {1833#(= main_~a~0 0)} is VALID [2018-11-23 11:59:11,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {1833#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1834#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {1834#(<= 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; {1834#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:11,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {1834#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {1835#(<= 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; {1835#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:11,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {1835#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:11,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {1836#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {1832#false} havoc ~i~0;~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {1832#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1832#false} is VALID [2018-11-23 11:59:11,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {1832#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1832#false} is VALID [2018-11-23 11:59:11,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {1832#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1832#false} is VALID [2018-11-23 11:59:11,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {1832#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1832#false} is VALID [2018-11-23 11:59:11,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {1832#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1832#false} is VALID [2018-11-23 11:59:11,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {1832#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1832#false} is VALID [2018-11-23 11:59:11,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {1832#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1832#false} is VALID [2018-11-23 11:59:11,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {1832#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1832#false} is VALID [2018-11-23 11:59:11,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {1832#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1832#false} is VALID [2018-11-23 11:59:11,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {1832#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1832#false} is VALID [2018-11-23 11:59:11,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {1832#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1832#false} is VALID [2018-11-23 11:59:11,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {1832#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1832#false} is VALID [2018-11-23 11:59:11,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {1832#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1832#false} is VALID [2018-11-23 11:59:11,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {1832#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1832#false} is VALID [2018-11-23 11:59:11,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {1832#false} havoc ~x~0;~x~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {1832#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1832#false} is VALID [2018-11-23 11:59:11,562 INFO L256 TraceCheckUtils]: 57: Hoare triple {1832#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {1832#false} is VALID [2018-11-23 11:59:11,563 INFO L273 TraceCheckUtils]: 58: Hoare triple {1832#false} ~cond := #in~cond; {1832#false} is VALID [2018-11-23 11:59:11,563 INFO L273 TraceCheckUtils]: 59: Hoare triple {1832#false} assume 0 == ~cond; {1832#false} is VALID [2018-11-23 11:59:11,563 INFO L273 TraceCheckUtils]: 60: Hoare triple {1832#false} assume !false; {1832#false} is VALID [2018-11-23 11:59:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:59:11,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:11,567 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 11:59:11,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:11,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:59:11,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:11,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {1831#true} call ULTIMATE.init(); {1831#true} is VALID [2018-11-23 11:59:11,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {1831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1831#true} is VALID [2018-11-23 11:59:11,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {1831#true} assume true; {1831#true} is VALID [2018-11-23 11:59:11,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1831#true} {1831#true} #147#return; {1831#true} is VALID [2018-11-23 11:59:11,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {1831#true} call #t~ret19 := main(); {1831#true} is VALID [2018-11-23 11:59:11,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {1831#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);havoc ~a~0;~a~0 := 0; {1831#true} is VALID [2018-11-23 11:59:11,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:59:11,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:59:11,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {1831#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1831#true} is VALID [2018-11-23 11:59:11,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {1831#true} assume !(~a~0 < 100000); {1831#true} is VALID [2018-11-23 11:59:11,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {1831#true} havoc ~i~0;~i~0 := 0; {1831#true} is VALID [2018-11-23 11:59:11,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {1831#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1831#true} is VALID [2018-11-23 11:59:11,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {1831#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1831#true} is VALID [2018-11-23 11:59:11,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:59:11,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {1831#true} ~i~0 := 0; {1831#true} is VALID [2018-11-23 11:59:11,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {1831#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1831#true} is VALID [2018-11-23 11:59:11,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {1831#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1831#true} is VALID [2018-11-23 11:59:11,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:59:11,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {1831#true} ~i~0 := 0; {1831#true} is VALID [2018-11-23 11:59:11,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {1831#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1831#true} is VALID [2018-11-23 11:59:11,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {1831#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; {1831#true} is VALID [2018-11-23 11:59:11,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {1831#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1831#true} is VALID [2018-11-23 11:59:11,782 INFO L273 TraceCheckUtils]: 30: Hoare triple {1831#true} assume !(~i~0 < 100000); {1831#true} is VALID [2018-11-23 11:59:11,782 INFO L273 TraceCheckUtils]: 31: Hoare triple {1831#true} ~i~0 := 0; {1933#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,783 INFO L273 TraceCheckUtils]: 32: Hoare triple {1933#(<= 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; {1933#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {1933#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {1940#(<= 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; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {1940#(<= main_~i~0 1)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1947#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {1947#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {1832#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1832#false} is VALID [2018-11-23 11:59:11,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {1832#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1832#false} is VALID [2018-11-23 11:59:11,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {1832#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1832#false} is VALID [2018-11-23 11:59:11,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,788 INFO L273 TraceCheckUtils]: 47: Hoare triple {1832#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1832#false} is VALID [2018-11-23 11:59:11,788 INFO L273 TraceCheckUtils]: 48: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,789 INFO L273 TraceCheckUtils]: 49: Hoare triple {1832#false} ~i~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {1832#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1832#false} is VALID [2018-11-23 11:59:11,789 INFO L273 TraceCheckUtils]: 52: Hoare triple {1832#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; {1832#false} is VALID [2018-11-23 11:59:11,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {1832#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1832#false} is VALID [2018-11-23 11:59:11,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {1832#false} assume !(~i~0 < 100000); {1832#false} is VALID [2018-11-23 11:59:11,790 INFO L273 TraceCheckUtils]: 55: Hoare triple {1832#false} havoc ~x~0;~x~0 := 0; {1832#false} is VALID [2018-11-23 11:59:11,790 INFO L273 TraceCheckUtils]: 56: Hoare triple {1832#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {1832#false} is VALID [2018-11-23 11:59:11,791 INFO L256 TraceCheckUtils]: 57: Hoare triple {1832#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {1832#false} is VALID [2018-11-23 11:59:11,791 INFO L273 TraceCheckUtils]: 58: Hoare triple {1832#false} ~cond := #in~cond; {1832#false} is VALID [2018-11-23 11:59:11,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {1832#false} assume 0 == ~cond; {1832#false} is VALID [2018-11-23 11:59:11,791 INFO L273 TraceCheckUtils]: 60: Hoare triple {1832#false} assume !false; {1832#false} is VALID [2018-11-23 11:59:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 11:59:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:11,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:59:11,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 11:59:11,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:11,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:59:11,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:11,945 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 9 states. [2018-11-23 11:59:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,793 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2018-11-23 11:59:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:59:12,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 11:59:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:59:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:59:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:59:12,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2018-11-23 11:59:13,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,047 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:59:13,048 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:59:13,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:59:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-23 11:59:13,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:13,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 82 states. [2018-11-23 11:59:13,139 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 82 states. [2018-11-23 11:59:13,139 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 82 states. [2018-11-23 11:59:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,143 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:59:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 11:59:13,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:13,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:13,143 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 90 states. [2018-11-23 11:59:13,144 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 90 states. [2018-11-23 11:59:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,147 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:59:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 11:59:13,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:13,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:13,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:13,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:59:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-11-23 11:59:13,151 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 61 [2018-11-23 11:59:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:13,151 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-11-23 11:59:13,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-11-23 11:59:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:13,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:13,152 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 11:59:13,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:13,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1047303028, now seen corresponding path program 4 times [2018-11-23 11:59:13,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:13,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:13,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {2531#true} call ULTIMATE.init(); {2531#true} is VALID [2018-11-23 11:59:13,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {2531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2531#true} is VALID [2018-11-23 11:59:13,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {2531#true} assume true; {2531#true} is VALID [2018-11-23 11:59:13,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2531#true} {2531#true} #147#return; {2531#true} is VALID [2018-11-23 11:59:13,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {2531#true} call #t~ret19 := main(); {2531#true} is VALID [2018-11-23 11:59:13,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {2531#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);havoc ~a~0;~a~0 := 0; {2533#(= main_~a~0 0)} is VALID [2018-11-23 11:59:13,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {2533#(= 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; {2533#(= main_~a~0 0)} is VALID [2018-11-23 11:59:13,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {2533#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2534#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {2534#(<= 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; {2534#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {2534#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2535#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {2535#(<= 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; {2535#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {2535#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2536#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {2536#(<= 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; {2536#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {2536#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2537#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {2537#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {2532#false} havoc ~i~0;~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {2532#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2532#false} is VALID [2018-11-23 11:59:13,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {2532#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2532#false} is VALID [2018-11-23 11:59:13,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {2532#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2532#false} is VALID [2018-11-23 11:59:13,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {2532#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2532#false} is VALID [2018-11-23 11:59:13,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {2532#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {2532#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {2532#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {2532#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {2532#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {2532#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2532#false} is VALID [2018-11-23 11:59:13,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {2532#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {2532#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,615 INFO L273 TraceCheckUtils]: 48: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {2532#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2532#false} is VALID [2018-11-23 11:59:13,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {2532#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2532#false} is VALID [2018-11-23 11:59:13,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {2532#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 54: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {2532#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {2532#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2532#false} is VALID [2018-11-23 11:59:13,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 61: Hoare triple {2532#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 62: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {2532#false} ~i~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 65: Hoare triple {2532#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {2532#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2532#false} is VALID [2018-11-23 11:59:13,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {2532#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; {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {2532#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {2532#false} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {2532#false} havoc ~x~0;~x~0 := 0; {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {2532#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L256 TraceCheckUtils]: 73: Hoare triple {2532#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 74: Hoare triple {2532#false} ~cond := #in~cond; {2532#false} is VALID [2018-11-23 11:59:13,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {2532#false} assume 0 == ~cond; {2532#false} is VALID [2018-11-23 11:59:13,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {2532#false} assume !false; {2532#false} is VALID [2018-11-23 11:59:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 11:59:13,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:13,622 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 11:59:13,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:13,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:13,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:14,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {2531#true} call ULTIMATE.init(); {2531#true} is VALID [2018-11-23 11:59:14,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {2531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2531#true} is VALID [2018-11-23 11:59:14,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {2531#true} assume true; {2531#true} is VALID [2018-11-23 11:59:14,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2531#true} {2531#true} #147#return; {2531#true} is VALID [2018-11-23 11:59:14,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {2531#true} call #t~ret19 := main(); {2531#true} is VALID [2018-11-23 11:59:14,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {2531#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);havoc ~a~0;~a~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:59:14,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:59:14,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {2531#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {2531#true} assume !(~a~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {2531#true} havoc ~i~0;~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {2531#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {2531#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {2531#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {2531#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {2531#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {2531#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {2531#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {2531#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {2531#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2531#true} is VALID [2018-11-23 11:59:14,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 41: Hoare triple {2531#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 42: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {2531#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2531#true} is VALID [2018-11-23 11:59:14,687 INFO L273 TraceCheckUtils]: 44: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {2531#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2531#true} is VALID [2018-11-23 11:59:14,688 INFO L273 TraceCheckUtils]: 46: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,688 INFO L273 TraceCheckUtils]: 47: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {2531#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2531#true} is VALID [2018-11-23 11:59:14,689 INFO L273 TraceCheckUtils]: 50: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,689 INFO L273 TraceCheckUtils]: 51: Hoare triple {2531#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2531#true} is VALID [2018-11-23 11:59:14,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,689 INFO L273 TraceCheckUtils]: 53: Hoare triple {2531#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2531#true} is VALID [2018-11-23 11:59:14,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,690 INFO L273 TraceCheckUtils]: 55: Hoare triple {2531#true} ~i~0 := 0; {2531#true} is VALID [2018-11-23 11:59:14,690 INFO L273 TraceCheckUtils]: 56: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {2531#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2531#true} is VALID [2018-11-23 11:59:14,691 INFO L273 TraceCheckUtils]: 58: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,691 INFO L273 TraceCheckUtils]: 59: Hoare triple {2531#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2531#true} is VALID [2018-11-23 11:59:14,691 INFO L273 TraceCheckUtils]: 60: Hoare triple {2531#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; {2531#true} is VALID [2018-11-23 11:59:14,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {2531#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2531#true} is VALID [2018-11-23 11:59:14,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {2531#true} assume !(~i~0 < 100000); {2531#true} is VALID [2018-11-23 11:59:14,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {2531#true} ~i~0 := 0; {2730#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:14,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {2730#(<= main_~i~0 0)} 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; {2730#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:14,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {2730#(<= main_~i~0 0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2737#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:14,745 INFO L273 TraceCheckUtils]: 66: Hoare triple {2737#(<= main_~i~0 1)} 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; {2737#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:14,747 INFO L273 TraceCheckUtils]: 67: Hoare triple {2737#(<= main_~i~0 1)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2744#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:14,747 INFO L273 TraceCheckUtils]: 68: Hoare triple {2744#(<= main_~i~0 2)} 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; {2744#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:14,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {2744#(<= main_~i~0 2)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2751#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:14,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {2751#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2532#false} is VALID [2018-11-23 11:59:14,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {2532#false} havoc ~x~0;~x~0 := 0; {2532#false} is VALID [2018-11-23 11:59:14,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {2532#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {2532#false} is VALID [2018-11-23 11:59:14,748 INFO L256 TraceCheckUtils]: 73: Hoare triple {2532#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {2532#false} is VALID [2018-11-23 11:59:14,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {2532#false} ~cond := #in~cond; {2532#false} is VALID [2018-11-23 11:59:14,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {2532#false} assume 0 == ~cond; {2532#false} is VALID [2018-11-23 11:59:14,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {2532#false} assume !false; {2532#false} is VALID [2018-11-23 11:59:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:59:14,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:14,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 11:59:14,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:59:14,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:14,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:14,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:14,899 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 11 states. [2018-11-23 11:59:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,939 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 11:59:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:15,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:59:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2018-11-23 11:59:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2018-11-23 11:59:15,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 161 transitions. [2018-11-23 11:59:16,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:16,260 INFO L225 Difference]: With dead ends: 173 [2018-11-23 11:59:16,260 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:59:16,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:59:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-11-23 11:59:16,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:16,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 98 states. [2018-11-23 11:59:16,311 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 98 states. [2018-11-23 11:59:16,311 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 98 states. [2018-11-23 11:59:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,315 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 11:59:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-23 11:59:16,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,316 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 106 states. [2018-11-23 11:59:16,316 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 106 states. [2018-11-23 11:59:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:16,319 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 11:59:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-11-23 11:59:16,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:16,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:16,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:16,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:59:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-11-23 11:59:16,324 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 77 [2018-11-23 11:59:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:16,324 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-11-23 11:59:16,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-11-23 11:59:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:59:16,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:16,325 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 11:59:16,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:16,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1394391164, now seen corresponding path program 5 times [2018-11-23 11:59:16,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2018-11-23 11:59:16,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3382#true} is VALID [2018-11-23 11:59:16,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2018-11-23 11:59:16,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #147#return; {3382#true} is VALID [2018-11-23 11:59:16,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret19 := main(); {3382#true} is VALID [2018-11-23 11:59:16,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {3382#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);havoc ~a~0;~a~0 := 0; {3384#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {3384#(= 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; {3384#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {3384#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3385#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {3385#(<= 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; {3385#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {3385#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3386#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {3386#(<= 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; {3386#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {3386#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3387#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {3387#(<= 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; {3387#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {3387#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3388#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {3388#(<= 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; {3388#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {3388#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3389#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {3389#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {3383#false} havoc ~i~0;~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {3383#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3383#false} is VALID [2018-11-23 11:59:16,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {3383#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3383#false} is VALID [2018-11-23 11:59:16,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {3383#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3383#false} is VALID [2018-11-23 11:59:16,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {3383#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3383#false} is VALID [2018-11-23 11:59:16,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {3383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {3383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {3383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {3383#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {3383#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {3383#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {3383#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {3383#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 50: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 57: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,619 INFO L273 TraceCheckUtils]: 59: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 62: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 64: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 65: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:16,620 INFO L273 TraceCheckUtils]: 66: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 73: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:16,621 INFO L273 TraceCheckUtils]: 74: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 81: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:16,622 INFO L273 TraceCheckUtils]: 82: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {3383#false} havoc ~x~0;~x~0 := 0; {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {3383#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L256 TraceCheckUtils]: 89: Hoare triple {3383#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {3383#false} is VALID [2018-11-23 11:59:16,623 INFO L273 TraceCheckUtils]: 90: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2018-11-23 11:59:16,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2018-11-23 11:59:16,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2018-11-23 11:59:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 11:59:16,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,627 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 11:59:16,636 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:32,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:32,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:33,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2018-11-23 11:59:33,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3382#true} is VALID [2018-11-23 11:59:33,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2018-11-23 11:59:33,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #147#return; {3382#true} is VALID [2018-11-23 11:59:33,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret19 := main(); {3382#true} is VALID [2018-11-23 11:59:33,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {3382#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);havoc ~a~0;~a~0 := 0; {3382#true} is VALID [2018-11-23 11:59:33,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:59:33,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {3382#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {3382#true} assume !(~a~0 < 100000); {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {3382#true} havoc ~i~0;~i~0 := 0; {3382#true} is VALID [2018-11-23 11:59:33,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {3382#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {3382#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {3382#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {3382#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {3382#true} ~i~0 := 0; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {3382#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {3382#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3382#true} is VALID [2018-11-23 11:59:33,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {3382#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3382#true} is VALID [2018-11-23 11:59:33,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {3382#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; {3382#true} is VALID [2018-11-23 11:59:33,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {3382#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3382#true} is VALID [2018-11-23 11:59:33,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {3382#true} assume !(~i~0 < 100000); {3382#true} is VALID [2018-11-23 11:59:33,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {3382#true} ~i~0 := 0; {3504#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:33,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {3504#(<= main_~i~0 0)} 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; {3504#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:33,088 INFO L273 TraceCheckUtils]: 39: Hoare triple {3504#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3511#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:33,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {3511#(<= main_~i~0 1)} 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; {3511#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:33,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {3511#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3518#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:33,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {3518#(<= main_~i~0 2)} 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; {3518#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:33,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {3518#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3525#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:33,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {3525#(<= main_~i~0 3)} 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; {3525#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:33,096 INFO L273 TraceCheckUtils]: 45: Hoare triple {3525#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3532#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {3532#(<= main_~i~0 4)} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 49: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 51: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:33,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 53: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {3383#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 56: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 57: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 58: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:33,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 62: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 63: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 64: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 65: Hoare triple {3383#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 66: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 67: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:33,099 INFO L273 TraceCheckUtils]: 68: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 70: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 72: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 74: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 75: Hoare triple {3383#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {3383#false} is VALID [2018-11-23 11:59:33,100 INFO L273 TraceCheckUtils]: 76: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 77: Hoare triple {3383#false} ~i~0 := 0; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 78: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 79: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 81: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 82: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 83: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:33,101 INFO L273 TraceCheckUtils]: 84: Hoare triple {3383#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; {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 85: Hoare triple {3383#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {3383#false} assume !(~i~0 < 100000); {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 87: Hoare triple {3383#false} havoc ~x~0;~x~0 := 0; {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 88: Hoare triple {3383#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L256 TraceCheckUtils]: 89: Hoare triple {3383#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 90: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 91: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2018-11-23 11:59:33,102 INFO L273 TraceCheckUtils]: 92: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2018-11-23 11:59:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:59:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:33,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:59:33,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-23 11:59:33,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:33,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:59:33,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:33,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:59:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:59:33,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:33,202 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 13 states. [2018-11-23 11:59:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,213 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2018-11-23 11:59:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:34,213 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-23 11:59:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 11:59:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 11:59:34,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2018-11-23 11:59:34,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:34,427 INFO L225 Difference]: With dead ends: 203 [2018-11-23 11:59:34,428 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:59:34,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:59:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-23 11:59:34,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:34,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 114 states. [2018-11-23 11:59:34,490 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 114 states. [2018-11-23 11:59:34,490 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 114 states. [2018-11-23 11:59:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,493 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-11-23 11:59:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-23 11:59:34,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,494 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 122 states. [2018-11-23 11:59:34,494 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 122 states. [2018-11-23 11:59:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,497 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-11-23 11:59:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-23 11:59:34,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:34,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:59:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-23 11:59:34,502 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 93 [2018-11-23 11:59:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:34,502 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-23 11:59:34,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:59:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-23 11:59:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:59:34,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:34,504 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 11:59:34,504 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:34,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -26286996, now seen corresponding path program 6 times [2018-11-23 11:59:34,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:35,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {4384#true} call ULTIMATE.init(); {4384#true} is VALID [2018-11-23 11:59:35,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {4384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4384#true} is VALID [2018-11-23 11:59:35,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {4384#true} assume true; {4384#true} is VALID [2018-11-23 11:59:35,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4384#true} {4384#true} #147#return; {4384#true} is VALID [2018-11-23 11:59:35,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {4384#true} call #t~ret19 := main(); {4384#true} is VALID [2018-11-23 11:59:35,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {4384#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);havoc ~a~0;~a~0 := 0; {4386#(= main_~a~0 0)} is VALID [2018-11-23 11:59:35,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {4386#(= 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; {4386#(= main_~a~0 0)} is VALID [2018-11-23 11:59:35,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {4386#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4387#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:35,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {4387#(<= 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; {4387#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:35,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {4387#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4388#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:35,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {4388#(<= 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; {4388#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:35,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {4388#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4389#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:35,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {4389#(<= 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; {4389#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:35,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {4389#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4390#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:35,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {4390#(<= 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; {4390#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:35,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {4390#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4391#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:35,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {4391#(<= 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; {4391#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:35,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {4391#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4392#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:35,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {4392#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#false} havoc ~i~0;~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {4385#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4385#false} is VALID [2018-11-23 11:59:35,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {4385#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4385#false} is VALID [2018-11-23 11:59:35,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {4385#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4385#false} is VALID [2018-11-23 11:59:35,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {4385#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4385#false} is VALID [2018-11-23 11:59:35,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {4385#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4385#false} is VALID [2018-11-23 11:59:35,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {4385#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4385#false} is VALID [2018-11-23 11:59:35,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {4385#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4385#false} is VALID [2018-11-23 11:59:35,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {4385#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {4385#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {4385#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4385#false} is VALID [2018-11-23 11:59:35,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {4385#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {4385#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {4385#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4385#false} is VALID [2018-11-23 11:59:35,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {4385#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {4385#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 57: Hoare triple {4385#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4385#false} is VALID [2018-11-23 11:59:35,236 INFO L273 TraceCheckUtils]: 58: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {4385#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 60: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 61: Hoare triple {4385#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 63: Hoare triple {4385#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {4385#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 67: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 68: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 69: Hoare triple {4385#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 70: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,238 INFO L273 TraceCheckUtils]: 71: Hoare triple {4385#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4385#false} is VALID [2018-11-23 11:59:35,239 INFO L273 TraceCheckUtils]: 72: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,239 INFO L273 TraceCheckUtils]: 73: Hoare triple {4385#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4385#false} is VALID [2018-11-23 11:59:35,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {4385#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4385#false} is VALID [2018-11-23 11:59:35,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {4385#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4385#false} is VALID [2018-11-23 11:59:35,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,240 INFO L273 TraceCheckUtils]: 81: Hoare triple {4385#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 82: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 83: Hoare triple {4385#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 85: Hoare triple {4385#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 86: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,241 INFO L273 TraceCheckUtils]: 87: Hoare triple {4385#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4385#false} is VALID [2018-11-23 11:59:35,242 INFO L273 TraceCheckUtils]: 88: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,242 INFO L273 TraceCheckUtils]: 89: Hoare triple {4385#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4385#false} is VALID [2018-11-23 11:59:35,242 INFO L273 TraceCheckUtils]: 90: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,242 INFO L273 TraceCheckUtils]: 91: Hoare triple {4385#false} ~i~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,242 INFO L273 TraceCheckUtils]: 92: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 93: Hoare triple {4385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 94: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 95: Hoare triple {4385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 97: Hoare triple {4385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4385#false} is VALID [2018-11-23 11:59:35,243 INFO L273 TraceCheckUtils]: 98: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 99: Hoare triple {4385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 100: Hoare triple {4385#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; {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 101: Hoare triple {4385#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 102: Hoare triple {4385#false} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 103: Hoare triple {4385#false} havoc ~x~0;~x~0 := 0; {4385#false} is VALID [2018-11-23 11:59:35,244 INFO L273 TraceCheckUtils]: 104: Hoare triple {4385#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {4385#false} is VALID [2018-11-23 11:59:35,245 INFO L256 TraceCheckUtils]: 105: Hoare triple {4385#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {4385#false} is VALID [2018-11-23 11:59:35,245 INFO L273 TraceCheckUtils]: 106: Hoare triple {4385#false} ~cond := #in~cond; {4385#false} is VALID [2018-11-23 11:59:35,245 INFO L273 TraceCheckUtils]: 107: Hoare triple {4385#false} assume 0 == ~cond; {4385#false} is VALID [2018-11-23 11:59:35,245 INFO L273 TraceCheckUtils]: 108: Hoare triple {4385#false} assume !false; {4385#false} is VALID [2018-11-23 11:59:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-23 11:59:35,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:35,252 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 11:59:35,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:36,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:36,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:37,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {4384#true} call ULTIMATE.init(); {4384#true} is VALID [2018-11-23 11:59:37,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {4384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4384#true} is VALID [2018-11-23 11:59:37,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {4384#true} assume true; {4384#true} is VALID [2018-11-23 11:59:37,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4384#true} {4384#true} #147#return; {4384#true} is VALID [2018-11-23 11:59:37,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {4384#true} call #t~ret19 := main(); {4384#true} is VALID [2018-11-23 11:59:37,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {4384#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);havoc ~a~0;~a~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {4384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4384#true} is VALID [2018-11-23 11:59:37,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {4384#true} assume !(~a~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {4384#true} havoc ~i~0;~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {4384#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4384#true} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {4384#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {4384#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {4384#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {4384#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4384#true} is VALID [2018-11-23 11:59:37,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {4384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {4384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4384#true} is VALID [2018-11-23 11:59:37,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {4384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {4384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {4384#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4384#true} is VALID [2018-11-23 11:59:37,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {4384#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {4384#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {4384#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {4384#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 53: Hoare triple {4384#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 54: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,234 INFO L273 TraceCheckUtils]: 55: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 57: Hoare triple {4384#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 58: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {4384#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {4384#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4384#true} is VALID [2018-11-23 11:59:37,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,236 INFO L273 TraceCheckUtils]: 63: Hoare triple {4384#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4384#true} is VALID [2018-11-23 11:59:37,250 INFO L273 TraceCheckUtils]: 64: Hoare triple {4384#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; {4588#(< main_~i~0 100000)} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 65: Hoare triple {4588#(< main_~i~0 100000)} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4592#(<= main_~i~0 100000)} is VALID [2018-11-23 11:59:37,252 INFO L273 TraceCheckUtils]: 66: Hoare triple {4592#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 68: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 69: Hoare triple {4384#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 70: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 71: Hoare triple {4384#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#true} is VALID [2018-11-23 11:59:37,253 INFO L273 TraceCheckUtils]: 72: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 73: Hoare triple {4384#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 74: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 75: Hoare triple {4384#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 76: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 77: Hoare triple {4384#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 78: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,254 INFO L273 TraceCheckUtils]: 79: Hoare triple {4384#true} ~i~0 := 0; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 81: Hoare triple {4384#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 82: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 83: Hoare triple {4384#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 84: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,255 INFO L273 TraceCheckUtils]: 85: Hoare triple {4384#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4384#true} is VALID [2018-11-23 11:59:37,256 INFO L273 TraceCheckUtils]: 86: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,256 INFO L273 TraceCheckUtils]: 87: Hoare triple {4384#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4384#true} is VALID [2018-11-23 11:59:37,256 INFO L273 TraceCheckUtils]: 88: Hoare triple {4384#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; {4384#true} is VALID [2018-11-23 11:59:37,256 INFO L273 TraceCheckUtils]: 89: Hoare triple {4384#true} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {4384#true} is VALID [2018-11-23 11:59:37,256 INFO L273 TraceCheckUtils]: 90: Hoare triple {4384#true} assume !(~i~0 < 100000); {4384#true} is VALID [2018-11-23 11:59:37,257 INFO L273 TraceCheckUtils]: 91: Hoare triple {4384#true} ~i~0 := 0; {4671#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:37,257 INFO L273 TraceCheckUtils]: 92: Hoare triple {4671#(<= main_~i~0 0)} 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; {4671#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:37,258 INFO L273 TraceCheckUtils]: 93: Hoare triple {4671#(<= main_~i~0 0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4678#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:37,258 INFO L273 TraceCheckUtils]: 94: Hoare triple {4678#(<= main_~i~0 1)} 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; {4678#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:37,259 INFO L273 TraceCheckUtils]: 95: Hoare triple {4678#(<= main_~i~0 1)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4685#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:37,259 INFO L273 TraceCheckUtils]: 96: Hoare triple {4685#(<= main_~i~0 2)} 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; {4685#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:37,260 INFO L273 TraceCheckUtils]: 97: Hoare triple {4685#(<= main_~i~0 2)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:37,260 INFO L273 TraceCheckUtils]: 98: Hoare triple {4692#(<= main_~i~0 3)} 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; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:37,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {4692#(<= main_~i~0 3)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4699#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:37,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {4699#(<= main_~i~0 4)} 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; {4699#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:37,262 INFO L273 TraceCheckUtils]: 101: Hoare triple {4699#(<= main_~i~0 4)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4706#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:37,263 INFO L273 TraceCheckUtils]: 102: Hoare triple {4706#(<= main_~i~0 5)} assume !(~i~0 < 100000); {4385#false} is VALID [2018-11-23 11:59:37,263 INFO L273 TraceCheckUtils]: 103: Hoare triple {4385#false} havoc ~x~0;~x~0 := 0; {4385#false} is VALID [2018-11-23 11:59:37,263 INFO L273 TraceCheckUtils]: 104: Hoare triple {4385#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {4385#false} is VALID [2018-11-23 11:59:37,264 INFO L256 TraceCheckUtils]: 105: Hoare triple {4385#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {4385#false} is VALID [2018-11-23 11:59:37,264 INFO L273 TraceCheckUtils]: 106: Hoare triple {4385#false} ~cond := #in~cond; {4385#false} is VALID [2018-11-23 11:59:37,264 INFO L273 TraceCheckUtils]: 107: Hoare triple {4385#false} assume 0 == ~cond; {4385#false} is VALID [2018-11-23 11:59:37,264 INFO L273 TraceCheckUtils]: 108: Hoare triple {4385#false} assume !false; {4385#false} is VALID [2018-11-23 11:59:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-23 11:59:37,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:37,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 11:59:37,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 11:59:37,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:37,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:59:37,402 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 11:59:37,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:59:37,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:59:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:37,404 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 17 states. [2018-11-23 11:59:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,964 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2018-11-23 11:59:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:38,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 11:59:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 207 transitions. [2018-11-23 11:59:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 207 transitions. [2018-11-23 11:59:38,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 207 transitions. [2018-11-23 11:59:39,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:39,217 INFO L225 Difference]: With dead ends: 240 [2018-11-23 11:59:39,218 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:59:39,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:59:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-23 11:59:39,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:39,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 144 states. [2018-11-23 11:59:39,289 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 144 states. [2018-11-23 11:59:39,289 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 144 states. [2018-11-23 11:59:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,295 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 11:59:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 11:59:39,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:39,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:39,296 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 145 states. [2018-11-23 11:59:39,296 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 145 states. [2018-11-23 11:59:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,301 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 11:59:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-11-23 11:59:39,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:39,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:39,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:39,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:59:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 11:59:39,307 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 109 [2018-11-23 11:59:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:39,307 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 11:59:39,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:59:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 11:59:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:59:39,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:39,309 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:59:39,309 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:39,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1417223214, now seen corresponding path program 7 times [2018-11-23 11:59:39,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:39,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {5588#true} call ULTIMATE.init(); {5588#true} is VALID [2018-11-23 11:59:39,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {5588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5588#true} is VALID [2018-11-23 11:59:39,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {5588#true} assume true; {5588#true} is VALID [2018-11-23 11:59:39,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5588#true} {5588#true} #147#return; {5588#true} is VALID [2018-11-23 11:59:39,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {5588#true} call #t~ret19 := main(); {5588#true} is VALID [2018-11-23 11:59:39,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {5588#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);havoc ~a~0;~a~0 := 0; {5590#(= main_~a~0 0)} is VALID [2018-11-23 11:59:39,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {5590#(= 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; {5590#(= main_~a~0 0)} is VALID [2018-11-23 11:59:39,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {5590#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:39,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {5591#(<= 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; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:39,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {5591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:39,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {5592#(<= 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; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:39,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {5592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:39,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {5593#(<= 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; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:39,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {5593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:39,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {5594#(<= 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; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:39,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {5594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:39,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#(<= 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; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:39,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:39,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#(<= 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; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:39,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5597#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:39,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {5597#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {5589#false} havoc ~i~0;~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 70: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 72: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 73: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 76: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 78: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 79: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 80: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 83: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 84: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 85: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 87: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 88: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 89: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 90: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 91: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 92: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 93: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 94: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 95: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 96: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 97: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 99: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 101: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 102: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 103: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 104: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 105: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 106: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 107: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 108: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 109: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 110: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 111: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 112: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 113: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 114: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 115: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 116: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 117: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 118: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 119: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 120: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 121: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 122: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 123: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 124: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 125: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 126: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 127: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 128: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 129: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 130: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 131: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 132: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 133: Hoare triple {5589#false} havoc ~x~0;~x~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 134: Hoare triple {5589#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {5589#false} is VALID [2018-11-23 11:59:39,634 INFO L256 TraceCheckUtils]: 135: Hoare triple {5589#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {5589#false} is VALID [2018-11-23 11:59:39,634 INFO L273 TraceCheckUtils]: 136: Hoare triple {5589#false} ~cond := #in~cond; {5589#false} is VALID [2018-11-23 11:59:39,634 INFO L273 TraceCheckUtils]: 137: Hoare triple {5589#false} assume 0 == ~cond; {5589#false} is VALID [2018-11-23 11:59:39,634 INFO L273 TraceCheckUtils]: 138: Hoare triple {5589#false} assume !false; {5589#false} is VALID [2018-11-23 11:59:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:59:39,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:39,644 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 11:59:39,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:39,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {5588#true} call ULTIMATE.init(); {5588#true} is VALID [2018-11-23 11:59:39,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {5588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5588#true} is VALID [2018-11-23 11:59:39,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {5588#true} assume true; {5588#true} is VALID [2018-11-23 11:59:39,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5588#true} {5588#true} #147#return; {5588#true} is VALID [2018-11-23 11:59:39,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {5588#true} call #t~ret19 := main(); {5588#true} is VALID [2018-11-23 11:59:39,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {5588#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);havoc ~a~0;~a~0 := 0; {5616#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:39,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {5616#(<= 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; {5616#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:39,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {5616#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:39,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {5591#(<= 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; {5591#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:39,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {5591#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:39,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {5592#(<= 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; {5592#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:39,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {5592#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:39,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {5593#(<= 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; {5593#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:39,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {5593#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:39,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {5594#(<= 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; {5594#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:39,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {5594#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:39,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#(<= 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; {5595#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:39,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:39,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#(<= 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; {5596#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:39,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5597#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:39,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {5597#(<= main_~a~0 7)} assume !(~a~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {5589#false} havoc ~i~0;~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,920 INFO L273 TraceCheckUtils]: 26: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,920 INFO L273 TraceCheckUtils]: 27: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {5589#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5589#false} is VALID [2018-11-23 11:59:39,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {5589#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 60: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 62: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 63: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {5589#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 68: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 69: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 70: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 71: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,927 INFO L273 TraceCheckUtils]: 72: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,928 INFO L273 TraceCheckUtils]: 73: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,928 INFO L273 TraceCheckUtils]: 74: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,928 INFO L273 TraceCheckUtils]: 75: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 78: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 80: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 81: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 82: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,929 INFO L273 TraceCheckUtils]: 83: Hoare triple {5589#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5589#false} is VALID [2018-11-23 11:59:39,930 INFO L273 TraceCheckUtils]: 84: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,930 INFO L273 TraceCheckUtils]: 85: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,930 INFO L273 TraceCheckUtils]: 86: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,930 INFO L273 TraceCheckUtils]: 87: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,930 INFO L273 TraceCheckUtils]: 88: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 89: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 90: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 91: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 92: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 93: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,931 INFO L273 TraceCheckUtils]: 94: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,932 INFO L273 TraceCheckUtils]: 95: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,932 INFO L273 TraceCheckUtils]: 96: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,932 INFO L273 TraceCheckUtils]: 97: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,932 INFO L273 TraceCheckUtils]: 98: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,932 INFO L273 TraceCheckUtils]: 99: Hoare triple {5589#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 100: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 101: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 102: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 103: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 104: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,933 INFO L273 TraceCheckUtils]: 105: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,934 INFO L273 TraceCheckUtils]: 106: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,934 INFO L273 TraceCheckUtils]: 107: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,934 INFO L273 TraceCheckUtils]: 108: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,934 INFO L273 TraceCheckUtils]: 109: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,934 INFO L273 TraceCheckUtils]: 110: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 111: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 112: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 113: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 114: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 115: Hoare triple {5589#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {5589#false} is VALID [2018-11-23 11:59:39,935 INFO L273 TraceCheckUtils]: 116: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 117: Hoare triple {5589#false} ~i~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 120: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 121: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,936 INFO L273 TraceCheckUtils]: 122: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 126: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 127: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,937 INFO L273 TraceCheckUtils]: 128: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,938 INFO L273 TraceCheckUtils]: 129: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,938 INFO L273 TraceCheckUtils]: 130: Hoare triple {5589#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; {5589#false} is VALID [2018-11-23 11:59:39,938 INFO L273 TraceCheckUtils]: 131: Hoare triple {5589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5589#false} is VALID [2018-11-23 11:59:39,938 INFO L273 TraceCheckUtils]: 132: Hoare triple {5589#false} assume !(~i~0 < 100000); {5589#false} is VALID [2018-11-23 11:59:39,938 INFO L273 TraceCheckUtils]: 133: Hoare triple {5589#false} havoc ~x~0;~x~0 := 0; {5589#false} is VALID [2018-11-23 11:59:39,939 INFO L273 TraceCheckUtils]: 134: Hoare triple {5589#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {5589#false} is VALID [2018-11-23 11:59:39,939 INFO L256 TraceCheckUtils]: 135: Hoare triple {5589#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {5589#false} is VALID [2018-11-23 11:59:39,939 INFO L273 TraceCheckUtils]: 136: Hoare triple {5589#false} ~cond := #in~cond; {5589#false} is VALID [2018-11-23 11:59:39,939 INFO L273 TraceCheckUtils]: 137: Hoare triple {5589#false} assume 0 == ~cond; {5589#false} is VALID [2018-11-23 11:59:39,939 INFO L273 TraceCheckUtils]: 138: Hoare triple {5589#false} assume !false; {5589#false} is VALID [2018-11-23 11:59:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:59:39,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:39,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-11-23 11:59:39,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:39,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:40,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:40,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:40,063 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 11 states. [2018-11-23 11:59:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:40,539 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-11-23 11:59:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:40,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-11-23 11:59:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2018-11-23 11:59:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2018-11-23 11:59:40,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 104 transitions. [2018-11-23 11:59:40,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:40,669 INFO L225 Difference]: With dead ends: 270 [2018-11-23 11:59:40,669 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 11:59:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 11:59:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-11-23 11:59:41,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:41,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 146 states. [2018-11-23 11:59:41,152 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 146 states. [2018-11-23 11:59:41,152 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 146 states. [2018-11-23 11:59:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,156 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-23 11:59:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-11-23 11:59:41,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:41,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:41,157 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 147 states. [2018-11-23 11:59:41,157 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 147 states. [2018-11-23 11:59:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:41,160 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-23 11:59:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-11-23 11:59:41,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:41,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:41,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:41,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 11:59:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-11-23 11:59:41,164 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 139 [2018-11-23 11:59:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:41,165 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-11-23 11:59:41,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-11-23 11:59:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 11:59:41,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:41,167 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 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] [2018-11-23 11:59:41,167 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:41,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1670521780, now seen corresponding path program 8 times [2018-11-23 11:59:41,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:41,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {6928#true} call ULTIMATE.init(); {6928#true} is VALID [2018-11-23 11:59:41,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {6928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6928#true} is VALID [2018-11-23 11:59:41,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {6928#true} assume true; {6928#true} is VALID [2018-11-23 11:59:41,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6928#true} {6928#true} #147#return; {6928#true} is VALID [2018-11-23 11:59:41,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {6928#true} call #t~ret19 := main(); {6928#true} is VALID [2018-11-23 11:59:41,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {6928#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);havoc ~a~0;~a~0 := 0; {6930#(= main_~a~0 0)} is VALID [2018-11-23 11:59:41,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {6930#(= 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; {6930#(= main_~a~0 0)} is VALID [2018-11-23 11:59:41,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {6930#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#(<= 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; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {6932#(<= 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; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {6932#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {6933#(<= 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; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {6933#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {6934#(<= 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; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {6934#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {6935#(<= 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; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {6935#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {6936#(<= 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; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {6936#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {6937#(<= 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; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {6937#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:41,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {6938#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {6929#false} havoc ~i~0;~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 45: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 50: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 51: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,393 INFO L273 TraceCheckUtils]: 52: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 53: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 54: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 56: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 59: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,394 INFO L273 TraceCheckUtils]: 60: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 61: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 62: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 65: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 67: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,395 INFO L273 TraceCheckUtils]: 68: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 71: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 72: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 73: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 75: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 79: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 81: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 84: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 85: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,398 INFO L273 TraceCheckUtils]: 86: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 87: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 88: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 89: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 90: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 91: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,399 INFO L273 TraceCheckUtils]: 92: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 93: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 94: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 95: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 97: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,400 INFO L273 TraceCheckUtils]: 98: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 99: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 100: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 101: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 102: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 103: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,401 INFO L273 TraceCheckUtils]: 104: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 105: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 106: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 107: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 108: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 109: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,402 INFO L273 TraceCheckUtils]: 110: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 111: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 112: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 113: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 114: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 115: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 116: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 117: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 118: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,403 INFO L273 TraceCheckUtils]: 119: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 120: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 121: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 122: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 123: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 124: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 125: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,404 INFO L273 TraceCheckUtils]: 126: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 127: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 128: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 129: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 130: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 131: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,405 INFO L273 TraceCheckUtils]: 132: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L273 TraceCheckUtils]: 133: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L273 TraceCheckUtils]: 134: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L273 TraceCheckUtils]: 135: Hoare triple {6929#false} havoc ~x~0;~x~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L273 TraceCheckUtils]: 136: Hoare triple {6929#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L256 TraceCheckUtils]: 137: Hoare triple {6929#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {6929#false} is VALID [2018-11-23 11:59:41,406 INFO L273 TraceCheckUtils]: 138: Hoare triple {6929#false} ~cond := #in~cond; {6929#false} is VALID [2018-11-23 11:59:41,407 INFO L273 TraceCheckUtils]: 139: Hoare triple {6929#false} assume 0 == ~cond; {6929#false} is VALID [2018-11-23 11:59:41,407 INFO L273 TraceCheckUtils]: 140: Hoare triple {6929#false} assume !false; {6929#false} is VALID [2018-11-23 11:59:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:59:41,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:41,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:59:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:41,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:41,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:41,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:41,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {6928#true} call ULTIMATE.init(); {6928#true} is VALID [2018-11-23 11:59:41,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {6928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6928#true} is VALID [2018-11-23 11:59:41,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {6928#true} assume true; {6928#true} is VALID [2018-11-23 11:59:41,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6928#true} {6928#true} #147#return; {6928#true} is VALID [2018-11-23 11:59:41,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {6928#true} call #t~ret19 := main(); {6928#true} is VALID [2018-11-23 11:59:41,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {6928#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);havoc ~a~0;~a~0 := 0; {6957#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:41,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {6957#(<= 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; {6957#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:41,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {6957#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#(<= 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; {6931#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:41,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {6932#(<= 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; {6932#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:41,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {6932#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {6933#(<= 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; {6933#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:41,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {6933#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {6934#(<= 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; {6934#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:41,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {6934#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {6935#(<= 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; {6935#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:41,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {6935#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {6936#(<= 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; {6936#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:41,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {6936#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {6937#(<= 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; {6937#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:41,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {6937#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:41,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {6938#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {6929#false} havoc ~i~0;~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,749 INFO L273 TraceCheckUtils]: 29: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,749 INFO L273 TraceCheckUtils]: 30: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,750 INFO L273 TraceCheckUtils]: 34: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {6929#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6929#false} is VALID [2018-11-23 11:59:41,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,751 INFO L273 TraceCheckUtils]: 40: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,751 INFO L273 TraceCheckUtils]: 41: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 42: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 43: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,752 INFO L273 TraceCheckUtils]: 47: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {6929#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,753 INFO L273 TraceCheckUtils]: 55: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 58: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 59: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 60: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 62: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 63: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,754 INFO L273 TraceCheckUtils]: 64: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 68: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 69: Hoare triple {6929#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 70: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 71: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,755 INFO L273 TraceCheckUtils]: 72: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 73: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 77: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 78: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 79: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,756 INFO L273 TraceCheckUtils]: 80: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 81: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 82: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 83: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 84: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 85: Hoare triple {6929#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 86: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 87: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 88: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,757 INFO L273 TraceCheckUtils]: 89: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 90: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 91: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 92: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 93: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 94: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 95: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 96: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,758 INFO L273 TraceCheckUtils]: 97: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 98: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 99: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 100: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 101: Hoare triple {6929#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 102: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 103: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 104: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 105: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,759 INFO L273 TraceCheckUtils]: 106: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 107: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 108: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 109: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 110: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 111: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 112: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 113: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,760 INFO L273 TraceCheckUtils]: 114: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 115: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 116: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 117: Hoare triple {6929#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 118: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 119: Hoare triple {6929#false} ~i~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 120: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 121: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,761 INFO L273 TraceCheckUtils]: 122: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 123: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 124: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 125: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 126: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 127: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 128: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 129: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 130: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,762 INFO L273 TraceCheckUtils]: 131: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 132: Hoare triple {6929#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; {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 133: Hoare triple {6929#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 134: Hoare triple {6929#false} assume !(~i~0 < 100000); {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 135: Hoare triple {6929#false} havoc ~x~0;~x~0 := 0; {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 136: Hoare triple {6929#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L256 TraceCheckUtils]: 137: Hoare triple {6929#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 138: Hoare triple {6929#false} ~cond := #in~cond; {6929#false} is VALID [2018-11-23 11:59:41,763 INFO L273 TraceCheckUtils]: 139: Hoare triple {6929#false} assume 0 == ~cond; {6929#false} is VALID [2018-11-23 11:59:41,764 INFO L273 TraceCheckUtils]: 140: Hoare triple {6929#false} assume !false; {6929#false} is VALID [2018-11-23 11:59:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:59:41,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:41,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:41,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-11-23 11:59:41,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:41,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:41,872 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 11:59:41,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:41,873 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 12 states. [2018-11-23 11:59:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:43,200 INFO L93 Difference]: Finished difference Result 272 states and 288 transitions. [2018-11-23 11:59:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:43,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-11-23 11:59:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-23 11:59:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2018-11-23 11:59:43,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2018-11-23 11:59:43,829 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 11:59:43,832 INFO L225 Difference]: With dead ends: 272 [2018-11-23 11:59:43,832 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:59:43,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:59:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-11-23 11:59:44,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:44,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 148 states. [2018-11-23 11:59:44,001 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 148 states. [2018-11-23 11:59:44,002 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 148 states. [2018-11-23 11:59:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:44,005 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-23 11:59:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-11-23 11:59:44,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:44,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:44,006 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 149 states. [2018-11-23 11:59:44,006 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 149 states. [2018-11-23 11:59:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:44,010 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-23 11:59:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-11-23 11:59:44,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:44,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:44,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:44,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 11:59:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-11-23 11:59:44,014 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 141 [2018-11-23 11:59:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:44,014 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-11-23 11:59:44,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-11-23 11:59:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 11:59:44,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:44,016 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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] [2018-11-23 11:59:44,016 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:44,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1171059478, now seen corresponding path program 9 times [2018-11-23 11:59:44,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:44,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:44,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:44,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {8285#true} call ULTIMATE.init(); {8285#true} is VALID [2018-11-23 11:59:44,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {8285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8285#true} is VALID [2018-11-23 11:59:44,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {8285#true} assume true; {8285#true} is VALID [2018-11-23 11:59:44,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8285#true} {8285#true} #147#return; {8285#true} is VALID [2018-11-23 11:59:44,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {8285#true} call #t~ret19 := main(); {8285#true} is VALID [2018-11-23 11:59:44,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {8285#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);havoc ~a~0;~a~0 := 0; {8287#(= main_~a~0 0)} is VALID [2018-11-23 11:59:44,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {8287#(= 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; {8287#(= main_~a~0 0)} is VALID [2018-11-23 11:59:44,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {8287#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8288#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:44,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {8288#(<= 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; {8288#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:44,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {8288#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8289#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:44,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {8289#(<= 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; {8289#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:44,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {8289#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8290#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:44,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {8290#(<= 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; {8290#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:44,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {8290#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8291#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:44,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {8291#(<= 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; {8291#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:44,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {8291#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8292#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:44,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {8292#(<= 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; {8292#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:44,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {8292#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8293#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:44,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {8293#(<= 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; {8293#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:44,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {8293#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8294#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:44,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {8294#(<= 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; {8294#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:44,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {8294#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8295#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:44,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {8295#(<= 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; {8295#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:44,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {8295#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8296#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:44,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {8296#(<= main_~a~0 9)} assume !(~a~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {8286#false} havoc ~i~0;~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {8286#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 56: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,960 INFO L273 TraceCheckUtils]: 62: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 64: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 68: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 69: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 74: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 75: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 76: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 77: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 78: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,962 INFO L273 TraceCheckUtils]: 79: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 82: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 84: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 85: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 86: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 87: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 11:59:44,963 INFO L273 TraceCheckUtils]: 88: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 89: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 90: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 91: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 92: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 95: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,964 INFO L273 TraceCheckUtils]: 96: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 97: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 98: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 99: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 100: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 101: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 102: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 103: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 104: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,965 INFO L273 TraceCheckUtils]: 105: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 106: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 107: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 108: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 109: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 110: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 111: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 112: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,966 INFO L273 TraceCheckUtils]: 113: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 114: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 115: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 116: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 117: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 118: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 119: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 120: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 121: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,967 INFO L273 TraceCheckUtils]: 122: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 123: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 124: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 125: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 126: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 127: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 128: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 129: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,968 INFO L273 TraceCheckUtils]: 130: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 131: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 132: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 133: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 134: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 135: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 136: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 137: Hoare triple {8286#false} havoc ~x~0;~x~0 := 0; {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L273 TraceCheckUtils]: 138: Hoare triple {8286#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {8286#false} is VALID [2018-11-23 11:59:44,969 INFO L256 TraceCheckUtils]: 139: Hoare triple {8286#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {8286#false} is VALID [2018-11-23 11:59:44,970 INFO L273 TraceCheckUtils]: 140: Hoare triple {8286#false} ~cond := #in~cond; {8286#false} is VALID [2018-11-23 11:59:44,970 INFO L273 TraceCheckUtils]: 141: Hoare triple {8286#false} assume 0 == ~cond; {8286#false} is VALID [2018-11-23 11:59:44,970 INFO L273 TraceCheckUtils]: 142: Hoare triple {8286#false} assume !false; {8286#false} is VALID [2018-11-23 11:59:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-23 11:59:44,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:44,987 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 11:59:44,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:04,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 12:00:04,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:04,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:04,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {8285#true} call ULTIMATE.init(); {8285#true} is VALID [2018-11-23 12:00:04,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {8285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8285#true} is VALID [2018-11-23 12:00:04,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {8285#true} assume true; {8285#true} is VALID [2018-11-23 12:00:04,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8285#true} {8285#true} #147#return; {8285#true} is VALID [2018-11-23 12:00:04,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {8285#true} call #t~ret19 := main(); {8285#true} is VALID [2018-11-23 12:00:04,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {8285#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);havoc ~a~0;~a~0 := 0; {8285#true} is VALID [2018-11-23 12:00:04,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {8285#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; {8285#true} is VALID [2018-11-23 12:00:04,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {8285#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8285#true} is VALID [2018-11-23 12:00:04,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {8285#true} assume !(~a~0 < 100000); {8285#true} is VALID [2018-11-23 12:00:04,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {8285#true} havoc ~i~0;~i~0 := 0; {8375#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:04,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {8375#(<= 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; {8375#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:04,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {8375#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8382#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:04,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {8382#(<= 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; {8382#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:04,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {8382#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8389#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:04,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {8389#(<= 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; {8389#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:04,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {8389#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8396#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:04,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {8396#(<= 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; {8396#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:04,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {8396#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8403#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:04,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {8403#(<= 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; {8403#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:04,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {8403#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8410#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:04,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {8410#(<= 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; {8410#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:04,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {8410#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:04,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {8417#(<= 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; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:04,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {8417#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8424#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:04,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {8424#(<= main_~i~0 7)} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,833 INFO L273 TraceCheckUtils]: 41: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,833 INFO L273 TraceCheckUtils]: 42: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,833 INFO L273 TraceCheckUtils]: 43: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,834 INFO L273 TraceCheckUtils]: 45: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,834 INFO L273 TraceCheckUtils]: 46: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,834 INFO L273 TraceCheckUtils]: 47: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,835 INFO L273 TraceCheckUtils]: 49: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,836 INFO L273 TraceCheckUtils]: 52: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,836 INFO L273 TraceCheckUtils]: 53: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {8286#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8286#false} is VALID [2018-11-23 12:00:04,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,838 INFO L273 TraceCheckUtils]: 64: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,839 INFO L273 TraceCheckUtils]: 71: Hoare triple {8286#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8286#false} is VALID [2018-11-23 12:00:04,840 INFO L273 TraceCheckUtils]: 72: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,840 INFO L273 TraceCheckUtils]: 73: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,840 INFO L273 TraceCheckUtils]: 74: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,841 INFO L273 TraceCheckUtils]: 78: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,841 INFO L273 TraceCheckUtils]: 81: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,842 INFO L273 TraceCheckUtils]: 82: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,842 INFO L273 TraceCheckUtils]: 83: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,842 INFO L273 TraceCheckUtils]: 85: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {8286#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {8286#false} is VALID [2018-11-23 12:00:04,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,843 INFO L273 TraceCheckUtils]: 89: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,843 INFO L273 TraceCheckUtils]: 90: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,843 INFO L273 TraceCheckUtils]: 91: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,844 INFO L273 TraceCheckUtils]: 92: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,844 INFO L273 TraceCheckUtils]: 93: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,844 INFO L273 TraceCheckUtils]: 94: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,844 INFO L273 TraceCheckUtils]: 95: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,845 INFO L273 TraceCheckUtils]: 96: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,845 INFO L273 TraceCheckUtils]: 97: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,845 INFO L273 TraceCheckUtils]: 98: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,846 INFO L273 TraceCheckUtils]: 101: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,846 INFO L273 TraceCheckUtils]: 102: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,846 INFO L273 TraceCheckUtils]: 103: Hoare triple {8286#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8286#false} is VALID [2018-11-23 12:00:04,846 INFO L273 TraceCheckUtils]: 104: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,846 INFO L273 TraceCheckUtils]: 105: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,847 INFO L273 TraceCheckUtils]: 106: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,847 INFO L273 TraceCheckUtils]: 107: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,847 INFO L273 TraceCheckUtils]: 108: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,847 INFO L273 TraceCheckUtils]: 109: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,847 INFO L273 TraceCheckUtils]: 110: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 111: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 112: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 113: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 114: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 115: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,848 INFO L273 TraceCheckUtils]: 116: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,849 INFO L273 TraceCheckUtils]: 117: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,849 INFO L273 TraceCheckUtils]: 118: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,849 INFO L273 TraceCheckUtils]: 119: Hoare triple {8286#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {8286#false} is VALID [2018-11-23 12:00:04,849 INFO L273 TraceCheckUtils]: 120: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,849 INFO L273 TraceCheckUtils]: 121: Hoare triple {8286#false} ~i~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,850 INFO L273 TraceCheckUtils]: 122: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,850 INFO L273 TraceCheckUtils]: 123: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,850 INFO L273 TraceCheckUtils]: 124: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,850 INFO L273 TraceCheckUtils]: 125: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,850 INFO L273 TraceCheckUtils]: 126: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,851 INFO L273 TraceCheckUtils]: 127: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,851 INFO L273 TraceCheckUtils]: 128: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,851 INFO L273 TraceCheckUtils]: 129: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,851 INFO L273 TraceCheckUtils]: 130: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,852 INFO L273 TraceCheckUtils]: 131: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,852 INFO L273 TraceCheckUtils]: 132: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,852 INFO L273 TraceCheckUtils]: 133: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,852 INFO L273 TraceCheckUtils]: 134: Hoare triple {8286#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; {8286#false} is VALID [2018-11-23 12:00:04,852 INFO L273 TraceCheckUtils]: 135: Hoare triple {8286#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8286#false} is VALID [2018-11-23 12:00:04,853 INFO L273 TraceCheckUtils]: 136: Hoare triple {8286#false} assume !(~i~0 < 100000); {8286#false} is VALID [2018-11-23 12:00:04,853 INFO L273 TraceCheckUtils]: 137: Hoare triple {8286#false} havoc ~x~0;~x~0 := 0; {8286#false} is VALID [2018-11-23 12:00:04,853 INFO L273 TraceCheckUtils]: 138: Hoare triple {8286#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {8286#false} is VALID [2018-11-23 12:00:04,853 INFO L256 TraceCheckUtils]: 139: Hoare triple {8286#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {8286#false} is VALID [2018-11-23 12:00:04,854 INFO L273 TraceCheckUtils]: 140: Hoare triple {8286#false} ~cond := #in~cond; {8286#false} is VALID [2018-11-23 12:00:04,854 INFO L273 TraceCheckUtils]: 141: Hoare triple {8286#false} assume 0 == ~cond; {8286#false} is VALID [2018-11-23 12:00:04,854 INFO L273 TraceCheckUtils]: 142: Hoare triple {8286#false} assume !false; {8286#false} is VALID [2018-11-23 12:00:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-23 12:00:04,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:04,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-23 12:00:04,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-11-23 12:00:04,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:04,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:00:05,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:05,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:00:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:00:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:00:05,020 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 20 states. [2018-11-23 12:00:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:06,784 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2018-11-23 12:00:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:00:06,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-11-23 12:00:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:00:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2018-11-23 12:00:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:00:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2018-11-23 12:00:06,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 227 transitions. [2018-11-23 12:00:07,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:07,493 INFO L225 Difference]: With dead ends: 295 [2018-11-23 12:00:07,493 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 12:00:07,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:00:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 12:00:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2018-11-23 12:00:07,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:07,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 164 states. [2018-11-23 12:00:07,572 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 164 states. [2018-11-23 12:00:07,573 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 164 states. [2018-11-23 12:00:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,578 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-11-23 12:00:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-11-23 12:00:07,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,579 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 172 states. [2018-11-23 12:00:07,579 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 172 states. [2018-11-23 12:00:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,583 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-11-23 12:00:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-11-23 12:00:07,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:07,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 12:00:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2018-11-23 12:00:07,589 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 143 [2018-11-23 12:00:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:07,589 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2018-11-23 12:00:07,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:00:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2018-11-23 12:00:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 12:00:07,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:07,591 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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] [2018-11-23 12:00:07,591 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:07,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash 743890138, now seen corresponding path program 10 times [2018-11-23 12:00:07,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:07,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:07,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:08,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {9757#true} call ULTIMATE.init(); {9757#true} is VALID [2018-11-23 12:00:08,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {9757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9757#true} is VALID [2018-11-23 12:00:08,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {9757#true} assume true; {9757#true} is VALID [2018-11-23 12:00:08,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9757#true} {9757#true} #147#return; {9757#true} is VALID [2018-11-23 12:00:08,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {9757#true} call #t~ret19 := main(); {9757#true} is VALID [2018-11-23 12:00:08,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {9757#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);havoc ~a~0;~a~0 := 0; {9759#(= main_~a~0 0)} is VALID [2018-11-23 12:00:08,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {9759#(= 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; {9759#(= main_~a~0 0)} is VALID [2018-11-23 12:00:08,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {9759#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9760#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:08,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {9760#(<= 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; {9760#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:08,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {9760#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9761#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:08,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {9761#(<= 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; {9761#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:08,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {9761#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9762#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:08,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {9762#(<= 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; {9762#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:08,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {9762#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9763#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:08,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {9763#(<= 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; {9763#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:08,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {9763#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9764#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:08,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {9764#(<= 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; {9764#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:08,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {9764#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9765#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:08,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {9765#(<= 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; {9765#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:08,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {9765#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9766#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:08,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {9766#(<= 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; {9766#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:08,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {9766#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9767#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:08,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {9767#(<= 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; {9767#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:08,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {9767#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9768#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:08,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {9768#(<= 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; {9768#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:08,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {9768#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9769#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:08,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {9769#(<= main_~a~0 10)} assume !(~a~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {9758#false} havoc ~i~0;~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,757 INFO L273 TraceCheckUtils]: 29: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,758 INFO L273 TraceCheckUtils]: 37: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {9758#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9758#false} is VALID [2018-11-23 12:00:08,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 50: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 57: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 58: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 59: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 60: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 61: Hoare triple {9758#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9758#false} is VALID [2018-11-23 12:00:08,762 INFO L273 TraceCheckUtils]: 62: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 63: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 64: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 66: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 67: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 68: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 70: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,763 INFO L273 TraceCheckUtils]: 71: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 72: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 73: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 74: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 75: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 76: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 77: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 78: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,764 INFO L273 TraceCheckUtils]: 79: Hoare triple {9758#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 80: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 81: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 82: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 83: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 84: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 85: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 86: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 87: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 89: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 90: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 91: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 92: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 96: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,766 INFO L273 TraceCheckUtils]: 97: Hoare triple {9758#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 98: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 99: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 100: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 101: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 102: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 103: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 104: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 105: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,767 INFO L273 TraceCheckUtils]: 106: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 107: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 108: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 109: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 110: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 111: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 112: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 113: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,768 INFO L273 TraceCheckUtils]: 114: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 115: Hoare triple {9758#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 116: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 117: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 118: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 119: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 120: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 121: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,769 INFO L273 TraceCheckUtils]: 123: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 124: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 125: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 126: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 127: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 128: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 129: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 130: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 131: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,770 INFO L273 TraceCheckUtils]: 132: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 133: Hoare triple {9758#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 134: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 135: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 136: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 137: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 138: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 139: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,771 INFO L273 TraceCheckUtils]: 140: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 141: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 142: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 143: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 144: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 145: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 146: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 147: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 148: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,772 INFO L273 TraceCheckUtils]: 149: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 150: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 151: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 152: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 153: Hoare triple {9758#false} havoc ~x~0;~x~0 := 0; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 154: Hoare triple {9758#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L256 TraceCheckUtils]: 155: Hoare triple {9758#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 156: Hoare triple {9758#false} ~cond := #in~cond; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 157: Hoare triple {9758#false} assume 0 == ~cond; {9758#false} is VALID [2018-11-23 12:00:08,773 INFO L273 TraceCheckUtils]: 158: Hoare triple {9758#false} assume !false; {9758#false} is VALID [2018-11-23 12:00:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-23 12:00:08,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:08,783 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:00:08,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:08,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:08,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:08,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:09,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {9757#true} call ULTIMATE.init(); {9757#true} is VALID [2018-11-23 12:00:09,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {9757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9757#true} is VALID [2018-11-23 12:00:09,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {9757#true} assume true; {9757#true} is VALID [2018-11-23 12:00:09,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9757#true} {9757#true} #147#return; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {9757#true} call #t~ret19 := main(); {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {9757#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);havoc ~a~0;~a~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 22: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {9757#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {9757#true} assume !(~a~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {9757#true} havoc ~i~0;~i~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {9757#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {9757#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 76: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {9757#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 81: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,264 INFO L273 TraceCheckUtils]: 82: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 85: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 86: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 87: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 88: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 89: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 90: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,265 INFO L273 TraceCheckUtils]: 91: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 92: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 93: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 94: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 95: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 96: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 97: Hoare triple {9757#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,266 INFO L273 TraceCheckUtils]: 99: Hoare triple {9757#true} ~i~0 := 0; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 101: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 102: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 103: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 104: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 105: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 106: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 107: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,267 INFO L273 TraceCheckUtils]: 108: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 109: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 110: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 111: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 112: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 113: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 114: Hoare triple {9757#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; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {9757#true} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9757#true} is VALID [2018-11-23 12:00:09,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {9757#true} assume !(~i~0 < 100000); {9757#true} is VALID [2018-11-23 12:00:09,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {9757#true} ~i~0 := 0; {10124#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:09,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {10124#(<= 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; {10124#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:09,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {10124#(<= main_~i~0 0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10131#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:09,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {10131#(<= main_~i~0 1)} 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; {10131#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:09,270 INFO L273 TraceCheckUtils]: 121: Hoare triple {10131#(<= main_~i~0 1)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10138#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,271 INFO L273 TraceCheckUtils]: 122: Hoare triple {10138#(<= main_~i~0 2)} 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; {10138#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,271 INFO L273 TraceCheckUtils]: 123: Hoare triple {10138#(<= main_~i~0 2)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10145#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,272 INFO L273 TraceCheckUtils]: 124: Hoare triple {10145#(<= main_~i~0 3)} 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; {10145#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {10145#(<= main_~i~0 3)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10152#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,273 INFO L273 TraceCheckUtils]: 126: Hoare triple {10152#(<= main_~i~0 4)} 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; {10152#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {10152#(<= main_~i~0 4)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10159#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,274 INFO L273 TraceCheckUtils]: 128: Hoare triple {10159#(<= main_~i~0 5)} 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; {10159#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {10159#(<= main_~i~0 5)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10166#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,276 INFO L273 TraceCheckUtils]: 130: Hoare triple {10166#(<= main_~i~0 6)} 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; {10166#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,276 INFO L273 TraceCheckUtils]: 131: Hoare triple {10166#(<= main_~i~0 6)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10173#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,277 INFO L273 TraceCheckUtils]: 132: Hoare triple {10173#(<= main_~i~0 7)} 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; {10173#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,278 INFO L273 TraceCheckUtils]: 133: Hoare triple {10173#(<= main_~i~0 7)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {10180#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,278 INFO L273 TraceCheckUtils]: 134: Hoare triple {10180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:09,279 INFO L273 TraceCheckUtils]: 135: Hoare triple {9758#false} ~i~0 := 0; {9758#false} is VALID [2018-11-23 12:00:09,279 INFO L273 TraceCheckUtils]: 136: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,279 INFO L273 TraceCheckUtils]: 137: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,279 INFO L273 TraceCheckUtils]: 138: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,279 INFO L273 TraceCheckUtils]: 139: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,280 INFO L273 TraceCheckUtils]: 140: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,280 INFO L273 TraceCheckUtils]: 141: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,280 INFO L273 TraceCheckUtils]: 142: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,280 INFO L273 TraceCheckUtils]: 143: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,280 INFO L273 TraceCheckUtils]: 144: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 145: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 146: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 147: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 148: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 149: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,281 INFO L273 TraceCheckUtils]: 150: Hoare triple {9758#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; {9758#false} is VALID [2018-11-23 12:00:09,282 INFO L273 TraceCheckUtils]: 151: Hoare triple {9758#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9758#false} is VALID [2018-11-23 12:00:09,282 INFO L273 TraceCheckUtils]: 152: Hoare triple {9758#false} assume !(~i~0 < 100000); {9758#false} is VALID [2018-11-23 12:00:09,282 INFO L273 TraceCheckUtils]: 153: Hoare triple {9758#false} havoc ~x~0;~x~0 := 0; {9758#false} is VALID [2018-11-23 12:00:09,282 INFO L273 TraceCheckUtils]: 154: Hoare triple {9758#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {9758#false} is VALID [2018-11-23 12:00:09,282 INFO L256 TraceCheckUtils]: 155: Hoare triple {9758#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {9758#false} is VALID [2018-11-23 12:00:09,283 INFO L273 TraceCheckUtils]: 156: Hoare triple {9758#false} ~cond := #in~cond; {9758#false} is VALID [2018-11-23 12:00:09,283 INFO L273 TraceCheckUtils]: 157: Hoare triple {9758#false} assume 0 == ~cond; {9758#false} is VALID [2018-11-23 12:00:09,283 INFO L273 TraceCheckUtils]: 158: Hoare triple {9758#false} assume !false; {9758#false} is VALID [2018-11-23 12:00:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 12:00:09,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:09,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 12:00:09,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-11-23 12:00:09,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:09,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:00:09,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:09,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:00:09,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:00:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:00:09,464 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand 22 states. [2018-11-23 12:00:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:10,991 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2018-11-23 12:00:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:00:10,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-11-23 12:00:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:00:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2018-11-23 12:00:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:00:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2018-11-23 12:00:10,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 243 transitions. [2018-11-23 12:00:11,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:11,247 INFO L225 Difference]: With dead ends: 325 [2018-11-23 12:00:11,247 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 12:00:11,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:00:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 12:00:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-11-23 12:00:11,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:11,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 180 states. [2018-11-23 12:00:11,359 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 180 states. [2018-11-23 12:00:11,359 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 180 states. [2018-11-23 12:00:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,363 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 12:00:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2018-11-23 12:00:11,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,363 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 188 states. [2018-11-23 12:00:11,363 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 188 states. [2018-11-23 12:00:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,367 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 12:00:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 196 transitions. [2018-11-23 12:00:11,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:11,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 12:00:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 188 transitions. [2018-11-23 12:00:11,373 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 188 transitions. Word has length 159 [2018-11-23 12:00:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:11,373 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 188 transitions. [2018-11-23 12:00:11,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:00:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2018-11-23 12:00:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 12:00:11,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:11,375 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 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:00:11,376 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:11,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1615098678, now seen corresponding path program 11 times [2018-11-23 12:00:11,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:11,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:12,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {11380#true} call ULTIMATE.init(); {11380#true} is VALID [2018-11-23 12:00:12,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {11380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11380#true} is VALID [2018-11-23 12:00:12,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {11380#true} assume true; {11380#true} is VALID [2018-11-23 12:00:12,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11380#true} {11380#true} #147#return; {11380#true} is VALID [2018-11-23 12:00:12,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {11380#true} call #t~ret19 := main(); {11380#true} is VALID [2018-11-23 12:00:12,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {11380#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);havoc ~a~0;~a~0 := 0; {11382#(= main_~a~0 0)} is VALID [2018-11-23 12:00:12,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {11382#(= 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; {11382#(= main_~a~0 0)} is VALID [2018-11-23 12:00:12,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {11382#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11383#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {11383#(<= 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; {11383#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {11383#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11384#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {11384#(<= 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; {11384#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {11384#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11385#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {11385#(<= 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; {11385#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {11385#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11386#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {11386#(<= 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; {11386#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {11386#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11387#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {11387#(<= 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; {11387#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {11387#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11388#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {11388#(<= 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; {11388#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {11388#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11389#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {11389#(<= 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; {11389#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {11389#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11390#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {11390#(<= 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; {11390#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {11390#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11391#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {11391#(<= 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; {11391#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {11391#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11392#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {11392#(<= 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; {11392#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {11392#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11393#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:12,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {11393#(<= main_~a~0 11)} assume !(~a~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {11381#false} havoc ~i~0;~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {11381#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {11381#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,275 INFO L273 TraceCheckUtils]: 72: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 73: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 74: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 75: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 76: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 77: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 78: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 79: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 80: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 81: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 82: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 83: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 84: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 85: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 86: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 87: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 88: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 89: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 90: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 91: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 92: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 93: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 94: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 95: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 96: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 97: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 98: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 99: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 100: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 101: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 102: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 103: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 104: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 105: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 106: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 107: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 108: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 109: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 110: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 111: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 112: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 113: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 114: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 115: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 116: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 117: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 118: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 119: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 120: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 121: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 122: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 123: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 124: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 125: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 126: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 127: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 128: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 129: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 130: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 131: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 132: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 133: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 134: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 135: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 136: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 137: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 138: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 139: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 140: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 141: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 142: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 143: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 144: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 145: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 146: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 147: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 148: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 149: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 150: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 151: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 152: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 153: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 154: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 155: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 156: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 157: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 158: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 159: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 160: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 161: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 162: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 163: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 164: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 165: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 166: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 167: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 168: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 169: Hoare triple {11381#false} havoc ~x~0;~x~0 := 0; {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 170: Hoare triple {11381#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L256 TraceCheckUtils]: 171: Hoare triple {11381#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 172: Hoare triple {11381#false} ~cond := #in~cond; {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 173: Hoare triple {11381#false} assume 0 == ~cond; {11381#false} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 174: Hoare triple {11381#false} assume !false; {11381#false} is VALID [2018-11-23 12:00:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-11-23 12:00:12,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:12,303 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:00:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:37,900 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:01:37,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:38,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:38,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {11380#true} call ULTIMATE.init(); {11380#true} is VALID [2018-11-23 12:01:38,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {11380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11380#true} is VALID [2018-11-23 12:01:38,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {11380#true} assume true; {11380#true} is VALID [2018-11-23 12:01:38,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11380#true} {11380#true} #147#return; {11380#true} is VALID [2018-11-23 12:01:38,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {11380#true} call #t~ret19 := main(); {11380#true} is VALID [2018-11-23 12:01:38,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {11380#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);havoc ~a~0;~a~0 := 0; {11380#true} is VALID [2018-11-23 12:01:38,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {11380#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11380#true} is VALID [2018-11-23 12:01:38,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {11380#true} assume !(~a~0 < 100000); {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {11380#true} havoc ~i~0;~i~0 := 0; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 31: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 32: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 37: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {11380#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; {11380#true} is VALID [2018-11-23 12:01:38,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {11380#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11380#true} is VALID [2018-11-23 12:01:38,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {11380#true} assume !(~i~0 < 100000); {11380#true} is VALID [2018-11-23 12:01:38,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {11380#true} ~i~0 := 0; {11544#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:38,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {11544#(<= main_~i~0 0)} 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; {11544#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:38,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {11544#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11551#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {11551#(<= main_~i~0 1)} 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; {11551#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:38,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {11551#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11558#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {11558#(<= main_~i~0 2)} 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; {11558#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:38,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {11558#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11565#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:38,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {11565#(<= main_~i~0 3)} 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; {11565#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:38,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {11565#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11572#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:38,337 INFO L273 TraceCheckUtils]: 58: Hoare triple {11572#(<= main_~i~0 4)} 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; {11572#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:38,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {11572#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11579#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:38,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {11579#(<= main_~i~0 5)} 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; {11579#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:38,339 INFO L273 TraceCheckUtils]: 61: Hoare triple {11579#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11586#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:38,339 INFO L273 TraceCheckUtils]: 62: Hoare triple {11586#(<= main_~i~0 6)} 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; {11586#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:38,340 INFO L273 TraceCheckUtils]: 63: Hoare triple {11586#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11593#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:38,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {11593#(<= main_~i~0 7)} 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; {11593#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:38,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {11593#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11600#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:38,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {11600#(<= main_~i~0 8)} 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; {11600#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:38,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {11600#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11607#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:38,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {11607#(<= main_~i~0 9)} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,344 INFO L273 TraceCheckUtils]: 71: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,344 INFO L273 TraceCheckUtils]: 72: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,344 INFO L273 TraceCheckUtils]: 75: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,345 INFO L273 TraceCheckUtils]: 76: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,345 INFO L273 TraceCheckUtils]: 77: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,345 INFO L273 TraceCheckUtils]: 79: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,345 INFO L273 TraceCheckUtils]: 80: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,346 INFO L273 TraceCheckUtils]: 81: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,346 INFO L273 TraceCheckUtils]: 85: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,347 INFO L273 TraceCheckUtils]: 86: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,347 INFO L273 TraceCheckUtils]: 87: Hoare triple {11381#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11381#false} is VALID [2018-11-23 12:01:38,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,347 INFO L273 TraceCheckUtils]: 89: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,347 INFO L273 TraceCheckUtils]: 90: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,348 INFO L273 TraceCheckUtils]: 91: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,348 INFO L273 TraceCheckUtils]: 93: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,348 INFO L273 TraceCheckUtils]: 94: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,348 INFO L273 TraceCheckUtils]: 95: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 96: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 97: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 98: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 99: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 100: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 102: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,349 INFO L273 TraceCheckUtils]: 103: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 104: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 105: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 106: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 107: Hoare triple {11381#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 108: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 109: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 110: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 111: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,350 INFO L273 TraceCheckUtils]: 112: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 113: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 114: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 115: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 116: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 117: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 118: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 119: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,351 INFO L273 TraceCheckUtils]: 120: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 121: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 122: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 123: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 124: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 125: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 126: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 127: Hoare triple {11381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 128: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,352 INFO L273 TraceCheckUtils]: 129: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 130: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 131: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 132: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 133: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 134: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 135: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 136: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 137: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,353 INFO L273 TraceCheckUtils]: 138: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 139: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 140: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 141: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 142: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 143: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 144: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 145: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 146: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,354 INFO L273 TraceCheckUtils]: 147: Hoare triple {11381#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 148: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 149: Hoare triple {11381#false} ~i~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 150: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 151: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 152: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 153: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 154: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 155: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,355 INFO L273 TraceCheckUtils]: 156: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 157: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 158: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 159: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 160: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 161: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 162: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 163: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,356 INFO L273 TraceCheckUtils]: 164: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 165: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 166: Hoare triple {11381#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; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 167: Hoare triple {11381#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 168: Hoare triple {11381#false} assume !(~i~0 < 100000); {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 169: Hoare triple {11381#false} havoc ~x~0;~x~0 := 0; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 170: Hoare triple {11381#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L256 TraceCheckUtils]: 171: Hoare triple {11381#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 172: Hoare triple {11381#false} ~cond := #in~cond; {11381#false} is VALID [2018-11-23 12:01:38,357 INFO L273 TraceCheckUtils]: 173: Hoare triple {11381#false} assume 0 == ~cond; {11381#false} is VALID [2018-11-23 12:01:38,358 INFO L273 TraceCheckUtils]: 174: Hoare triple {11381#false} assume !false; {11381#false} is VALID [2018-11-23 12:01:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-23 12:01:38,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:38,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-23 12:01:38,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-23 12:01:38,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:38,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:01:38,495 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:38,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:01:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:01:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:01:38,497 INFO L87 Difference]: Start difference. First operand 180 states and 188 transitions. Second operand 24 states. [2018-11-23 12:01:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:39,578 INFO L93 Difference]: Finished difference Result 355 states and 378 transitions. [2018-11-23 12:01:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:01:39,579 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-23 12:01:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 259 transitions. [2018-11-23 12:01:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 259 transitions. [2018-11-23 12:01:39,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 259 transitions. [2018-11-23 12:01:41,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:41,529 INFO L225 Difference]: With dead ends: 355 [2018-11-23 12:01:41,529 INFO L226 Difference]: Without dead ends: 204 [2018-11-23 12:01:41,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:01:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-23 12:01:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-11-23 12:01:41,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:41,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 196 states. [2018-11-23 12:01:41,832 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 196 states. [2018-11-23 12:01:41,832 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 196 states. [2018-11-23 12:01:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,837 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-11-23 12:01:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 212 transitions. [2018-11-23 12:01:41,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:41,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:41,838 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 204 states. [2018-11-23 12:01:41,838 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 204 states. [2018-11-23 12:01:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:41,843 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-11-23 12:01:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 212 transitions. [2018-11-23 12:01:41,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:41,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:41,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:41,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 12:01:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2018-11-23 12:01:41,849 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 175 [2018-11-23 12:01:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:41,850 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2018-11-23 12:01:41,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:01:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2018-11-23 12:01:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-23 12:01:41,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:41,852 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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] [2018-11-23 12:01:41,852 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:41,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1310647110, now seen corresponding path program 12 times [2018-11-23 12:01:41,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:41,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:41,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:42,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {13154#true} call ULTIMATE.init(); {13154#true} is VALID [2018-11-23 12:01:42,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {13154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13154#true} is VALID [2018-11-23 12:01:42,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {13154#true} assume true; {13154#true} is VALID [2018-11-23 12:01:42,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13154#true} {13154#true} #147#return; {13154#true} is VALID [2018-11-23 12:01:42,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {13154#true} call #t~ret19 := main(); {13154#true} is VALID [2018-11-23 12:01:42,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {13154#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);havoc ~a~0;~a~0 := 0; {13156#(= main_~a~0 0)} is VALID [2018-11-23 12:01:42,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {13156#(= 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; {13156#(= main_~a~0 0)} is VALID [2018-11-23 12:01:42,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {13156#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13157#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:42,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {13157#(<= 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; {13157#(<= main_~a~0 1)} is VALID [2018-11-23 12:01:42,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {13157#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13158#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:42,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {13158#(<= 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; {13158#(<= main_~a~0 2)} is VALID [2018-11-23 12:01:42,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {13158#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13159#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:42,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {13159#(<= 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; {13159#(<= main_~a~0 3)} is VALID [2018-11-23 12:01:42,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {13159#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13160#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:42,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {13160#(<= 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; {13160#(<= main_~a~0 4)} is VALID [2018-11-23 12:01:42,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {13160#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13161#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:42,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {13161#(<= 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; {13161#(<= main_~a~0 5)} is VALID [2018-11-23 12:01:42,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {13161#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13162#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:42,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {13162#(<= 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; {13162#(<= main_~a~0 6)} is VALID [2018-11-23 12:01:42,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {13162#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13163#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:42,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {13163#(<= 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; {13163#(<= main_~a~0 7)} is VALID [2018-11-23 12:01:42,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {13163#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13164#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:42,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {13164#(<= 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; {13164#(<= main_~a~0 8)} is VALID [2018-11-23 12:01:42,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {13164#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13165#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:42,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {13165#(<= 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; {13165#(<= main_~a~0 9)} is VALID [2018-11-23 12:01:42,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {13165#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13166#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:42,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {13166#(<= 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; {13166#(<= main_~a~0 10)} is VALID [2018-11-23 12:01:42,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {13166#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13167#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:42,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {13167#(<= 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; {13167#(<= main_~a~0 11)} is VALID [2018-11-23 12:01:42,408 INFO L273 TraceCheckUtils]: 29: Hoare triple {13167#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13168#(<= main_~a~0 12)} is VALID [2018-11-23 12:01:42,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {13168#(<= main_~a~0 12)} assume !(~a~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {13155#false} havoc ~i~0;~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {13155#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 52: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,413 INFO L273 TraceCheckUtils]: 55: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,414 INFO L273 TraceCheckUtils]: 63: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 69: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 70: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 72: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {13155#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 74: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 75: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 76: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 77: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 79: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 80: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 81: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 82: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 83: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 84: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 85: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 88: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 89: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 90: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 91: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 92: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 94: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,418 INFO L273 TraceCheckUtils]: 95: Hoare triple {13155#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 96: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 97: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 98: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 99: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 100: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 101: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 102: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 103: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 105: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 106: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 107: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 108: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 109: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 110: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 111: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 112: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,420 INFO L273 TraceCheckUtils]: 113: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 114: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 115: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 116: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 117: Hoare triple {13155#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 118: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 119: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 120: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,421 INFO L273 TraceCheckUtils]: 121: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 122: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 123: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 124: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 125: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 126: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 127: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 128: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 129: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,422 INFO L273 TraceCheckUtils]: 130: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 131: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 132: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 133: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 134: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 135: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 136: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 137: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 138: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,423 INFO L273 TraceCheckUtils]: 139: Hoare triple {13155#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 140: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 141: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 142: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 143: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 144: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 145: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 146: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 147: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,424 INFO L273 TraceCheckUtils]: 148: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 149: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 150: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 151: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 152: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 153: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 154: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 155: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,425 INFO L273 TraceCheckUtils]: 156: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 157: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 158: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 159: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 160: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 161: Hoare triple {13155#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 162: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 163: Hoare triple {13155#false} ~i~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 164: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,426 INFO L273 TraceCheckUtils]: 165: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 166: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 167: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 168: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 169: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 170: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 171: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 172: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 173: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,427 INFO L273 TraceCheckUtils]: 174: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 175: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 176: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 177: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 178: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 179: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 180: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 181: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 182: Hoare triple {13155#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; {13155#false} is VALID [2018-11-23 12:01:42,428 INFO L273 TraceCheckUtils]: 183: Hoare triple {13155#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 184: Hoare triple {13155#false} assume !(~i~0 < 100000); {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 185: Hoare triple {13155#false} havoc ~x~0;~x~0 := 0; {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 186: Hoare triple {13155#false} assume !!(~x~0 < 100000);call #t~mem17 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~x~0, 4); {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L256 TraceCheckUtils]: 187: Hoare triple {13155#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1 else 0)); {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 188: Hoare triple {13155#false} ~cond := #in~cond; {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 189: Hoare triple {13155#false} assume 0 == ~cond; {13155#false} is VALID [2018-11-23 12:01:42,429 INFO L273 TraceCheckUtils]: 190: Hoare triple {13155#false} assume !false; {13155#false} is VALID [2018-11-23 12:01:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-23 12:01:42,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:42,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:42,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE