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_copy5_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:58,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:58,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:58,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:58,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:58,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:58,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:58,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:58,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:58,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:58,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:58,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:58,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:58,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:58,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:58,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:58,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:58,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:58,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:58,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:58,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:58,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:58,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:58,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:58,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:58,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:58,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:58,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:58,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:58,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:58,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:58,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:58,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:58,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:58,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:58,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:58,488 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:58:58,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:58,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:58,505 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:58,505 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:58,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:58,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:58,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:58,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:58,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:58,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:58,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:58,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:58,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:58,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:58,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:58,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:58,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:58,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:58,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:58,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:58,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:58,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:58,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:58,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:58,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:58,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:58,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:58,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:58,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:58,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:58,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:58,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_true-unreach-call_ground.i [2018-11-23 11:58:58,645 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4d48dbb/dc6f6f9a56eb458e963831f3e79c83de/FLAGa23432d7a [2018-11-23 11:58:59,051 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:59,052 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_true-unreach-call_ground.i [2018-11-23 11:58:59,058 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4d48dbb/dc6f6f9a56eb458e963831f3e79c83de/FLAGa23432d7a [2018-11-23 11:58:59,427 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4d48dbb/dc6f6f9a56eb458e963831f3e79c83de [2018-11-23 11:58:59,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:59,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:59,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:59,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:59,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:59,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c04f9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59, skipping insertion in model container [2018-11-23 11:58:59,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:59,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:59,726 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:59,731 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:59,768 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:59,791 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:59,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59 WrapperNode [2018-11-23 11:58:59,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:59,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:59,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:59,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:59,802 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:58:59" (1/1) ... [2018-11-23 11:58:59,813 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:58:59" (1/1) ... [2018-11-23 11:58:59,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:59,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:59,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:59,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:59,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (1/1) ... [2018-11-23 11:58:59,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:59,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:59,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:59,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:59,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (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:58:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:58:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:59,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:00,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:00,864 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:59:00,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:00 BoogieIcfgContainer [2018-11-23 11:59:00,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:00,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:59:00,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:59:00,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:59:00,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:59" (1/3) ... [2018-11-23 11:59:00,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1896fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:00, skipping insertion in model container [2018-11-23 11:59:00,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:59" (2/3) ... [2018-11-23 11:59:00,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1896fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:00, skipping insertion in model container [2018-11-23 11:59:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:00" (3/3) ... [2018-11-23 11:59:00,874 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_true-unreach-call_ground.i [2018-11-23 11:59:00,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:59:00,893 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:59:00,911 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:59:00,943 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:59:00,944 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:59:00,944 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:59:00,945 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:59:00,945 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:59:00,945 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:59:00,945 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:59:00,945 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:59:00,946 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:59:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 11:59:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:59:00,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,974 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] [2018-11-23 11:59:00,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2095174276, now seen corresponding path program 1 times [2018-11-23 11:59:00,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:01,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:01,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-23 11:59:01,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42#true} is VALID [2018-11-23 11:59:01,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-23 11:59:01,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #119#return; {42#true} is VALID [2018-11-23 11:59:01,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret15 := main(); {42#true} is VALID [2018-11-23 11:59:01,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#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);havoc ~a~0;~a~0 := 0; {42#true} is VALID [2018-11-23 11:59:01,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-23 11:59:01,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#false} havoc ~i~0;~i~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:59:01,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:59:01,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:59:01,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:59:01,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !(~i~0 < 100000); {43#false} is VALID [2018-11-23 11:59:01,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {43#false} havoc ~x~0;~x~0 := 0; {43#false} is VALID [2018-11-23 11:59:01,153 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {43#false} is VALID [2018-11-23 11:59:01,154 INFO L256 TraceCheckUtils]: 19: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {43#false} is VALID [2018-11-23 11:59:01,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2018-11-23 11:59:01,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2018-11-23 11:59:01,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-23 11:59:01,159 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:01,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:59:01,167 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:59:01,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:59:01,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:01,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:59:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:59:01,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:59:01,394 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 11:59:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:01,498 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 11:59:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:59:01,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:59:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 11:59:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:59:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 11:59:01,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2018-11-23 11:59:01,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:01,922 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:59:01,923 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:59:01,928 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:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:59:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:59:02,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:59:02,132 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:59:02,132 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:59:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,139 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:59:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:59:02,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,143 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:59:02,143 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:59:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,157 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:59:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:59:02,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 11:59:02,172 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 11:59:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:02,173 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 11:59:02,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:59:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:59:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:59:02,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:02,177 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] [2018-11-23 11:59:02,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:02,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1625097866, now seen corresponding path program 1 times [2018-11-23 11:59:02,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:02,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:02,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {252#true} call ULTIMATE.init(); {252#true} is VALID [2018-11-23 11:59:02,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {252#true} is VALID [2018-11-23 11:59:02,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {252#true} assume true; {252#true} is VALID [2018-11-23 11:59:02,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {252#true} {252#true} #119#return; {252#true} is VALID [2018-11-23 11:59:02,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {252#true} call #t~ret15 := main(); {252#true} is VALID [2018-11-23 11:59:02,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {252#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);havoc ~a~0;~a~0 := 0; {254#(= main_~a~0 0)} is VALID [2018-11-23 11:59:02,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {254#(= main_~a~0 0)} assume !(~a~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {253#false} havoc ~i~0;~i~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {253#false} ~i~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {253#false} assume !(~i~0 < 100000); {253#false} is VALID [2018-11-23 11:59:02,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {253#false} havoc ~x~0;~x~0 := 0; {253#false} is VALID [2018-11-23 11:59:02,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {253#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {253#false} is VALID [2018-11-23 11:59:02,524 INFO L256 TraceCheckUtils]: 19: Hoare triple {253#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {253#false} is VALID [2018-11-23 11:59:02,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {253#false} ~cond := #in~cond; {253#false} is VALID [2018-11-23 11:59:02,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {253#false} assume 0 == ~cond; {253#false} is VALID [2018-11-23 11:59:02,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {253#false} assume !false; {253#false} is VALID [2018-11-23 11:59:02,527 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:02,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:02,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:59:02,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:02,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:02,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:02,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:02,581 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-11-23 11:59:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,893 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 11:59:02,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:02,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:59:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 11:59:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 11:59:02,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 11:59:03,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,139 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:59:03,140 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:59:03,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:59:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 11:59:03,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 11:59:03,155 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 11:59:03,156 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 11:59:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,159 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:59:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:59:03,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,161 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 11:59:03,161 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 11:59:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,164 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:59:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:59:03,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:59:03,168 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2018-11-23 11:59:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,169 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:59:03,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:59:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:59:03,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,170 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] [2018-11-23 11:59:03,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1623092332, now seen corresponding path program 1 times [2018-11-23 11:59:03,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:03,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 11:59:03,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {462#true} is VALID [2018-11-23 11:59:03,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 11:59:03,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #119#return; {462#true} is VALID [2018-11-23 11:59:03,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret15 := main(); {462#true} is VALID [2018-11-23 11:59:03,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#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);havoc ~a~0;~a~0 := 0; {462#true} is VALID [2018-11-23 11:59:03,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {462#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; {462#true} is VALID [2018-11-23 11:59:03,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {462#true} is VALID [2018-11-23 11:59:03,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {462#true} assume !(~a~0 < 100000); {462#true} is VALID [2018-11-23 11:59:03,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {462#true} havoc ~i~0;~i~0 := 0; {464#(= main_~i~0 0)} is VALID [2018-11-23 11:59:03,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {464#(= main_~i~0 0)} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:59:03,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:59:03,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:59:03,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:59:03,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:59:03,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:59:03,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:59:03,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} ~i~0 := 0; {463#false} is VALID [2018-11-23 11:59:03,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !(~i~0 < 100000); {463#false} is VALID [2018-11-23 11:59:03,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {463#false} havoc ~x~0;~x~0 := 0; {463#false} is VALID [2018-11-23 11:59:03,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {463#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {463#false} is VALID [2018-11-23 11:59:03,292 INFO L256 TraceCheckUtils]: 21: Hoare triple {463#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {463#false} is VALID [2018-11-23 11:59:03,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-23 11:59:03,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {463#false} assume 0 == ~cond; {463#false} is VALID [2018-11-23 11:59:03,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 11:59:03,294 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:03,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:03,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:03,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:59:03,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:03,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:59:03,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:03,374 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-23 11:59:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,675 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 11:59:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:03,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:59:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:59:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:59:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:59:03,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 11:59:03,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:03,870 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:59:03,870 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:59:03,871 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:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:59:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-23 11:59:03,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:03,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 40 states. [2018-11-23 11:59:03,905 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 40 states. [2018-11-23 11:59:03,905 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 40 states. [2018-11-23 11:59:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,908 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:59:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:59:03,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,910 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 45 states. [2018-11-23 11:59:03,910 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 45 states. [2018-11-23 11:59:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:03,912 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:59:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:59:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:03,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:03,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:03,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 11:59:03,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2018-11-23 11:59:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,917 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 11:59:03,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:59:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:59:03,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,919 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] [2018-11-23 11:59:03,919 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1928668694, now seen corresponding path program 1 times [2018-11-23 11:59:03,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:59:04,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-23 11:59:04,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:59:04,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #119#return; {710#true} is VALID [2018-11-23 11:59:04,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret15 := main(); {710#true} is VALID [2018-11-23 11:59:04,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#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);havoc ~a~0;~a~0 := 0; {712#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#(= 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; {712#(= main_~a~0 0)} is VALID [2018-11-23 11:59:04,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {713#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(<= main_~a~0 1)} assume !(~a~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {711#false} havoc ~i~0;~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {711#false} is VALID [2018-11-23 11:59:04,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {711#false} is VALID [2018-11-23 11:59:04,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {711#false} is VALID [2018-11-23 11:59:04,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {711#false} is VALID [2018-11-23 11:59:04,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {711#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {711#false} is VALID [2018-11-23 11:59:04,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {711#false} havoc ~x~0;~x~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {711#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {711#false} is VALID [2018-11-23 11:59:04,075 INFO L256 TraceCheckUtils]: 31: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {711#false} is VALID [2018-11-23 11:59:04,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 11:59:04,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-23 11:59:04,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:59:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:59:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,079 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:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:04,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:59:04,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-23 11:59:04,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:59:04,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #119#return; {710#true} is VALID [2018-11-23 11:59:04,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret15 := main(); {710#true} is VALID [2018-11-23 11:59:04,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#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);havoc ~a~0;~a~0 := 0; {732#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {732#(<= 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; {732#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:04,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {713#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(<= main_~a~0 1)} assume !(~a~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {711#false} havoc ~i~0;~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {711#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {711#false} is VALID [2018-11-23 11:59:04,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {711#false} is VALID [2018-11-23 11:59:04,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {711#false} is VALID [2018-11-23 11:59:04,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {711#false} is VALID [2018-11-23 11:59:04,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {711#false} ~i~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {711#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; {711#false} is VALID [2018-11-23 11:59:04,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {711#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {711#false} is VALID [2018-11-23 11:59:04,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(~i~0 < 100000); {711#false} is VALID [2018-11-23 11:59:04,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {711#false} havoc ~x~0;~x~0 := 0; {711#false} is VALID [2018-11-23 11:59:04,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {711#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {711#false} is VALID [2018-11-23 11:59:04,432 INFO L256 TraceCheckUtils]: 31: Hoare triple {711#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {711#false} is VALID [2018-11-23 11:59:04,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-23 11:59:04,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2018-11-23 11:59:04,433 INFO L273 TraceCheckUtils]: 34: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:59:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:59:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:04,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:59:04,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:59:04,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:04,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:59:04,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:04,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:04,591 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 11:59:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,803 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-11-23 11:59:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:04,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:59:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 11:59:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:59:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 11:59:04,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-23 11:59:04,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:04,950 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:59:04,950 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:59:04,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:59:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 11:59:04,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:04,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 11:59:04,986 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 11:59:04,986 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 11:59:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,990 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 11:59:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 11:59:04,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,991 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 11:59:04,991 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 11:59:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:04,994 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 11:59:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 11:59:04,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:04,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:04,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:04,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 11:59:04,997 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2018-11-23 11:59:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:04,998 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 11:59:04,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:59:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:59:04,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:04,999 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] [2018-11-23 11:59:05,000 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 359479048, now seen corresponding path program 2 times [2018-11-23 11:59:05,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:05,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 11:59:05,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1074#true} is VALID [2018-11-23 11:59:05,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 11:59:05,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #119#return; {1074#true} is VALID [2018-11-23 11:59:05,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret15 := main(); {1074#true} is VALID [2018-11-23 11:59:05,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#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);havoc ~a~0;~a~0 := 0; {1076#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {1076#(= 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; {1076#(= main_~a~0 0)} is VALID [2018-11-23 11:59:05,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1076#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(<= 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; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#false} havoc ~i~0;~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1075#false} is VALID [2018-11-23 11:59:05,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1075#false} is VALID [2018-11-23 11:59:05,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {1075#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1075#false} is VALID [2018-11-23 11:59:05,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {1075#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1075#false} is VALID [2018-11-23 11:59:05,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {1075#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1075#false} is VALID [2018-11-23 11:59:05,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,147 INFO L273 TraceCheckUtils]: 31: Hoare triple {1075#false} havoc ~x~0;~x~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {1075#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1075#false} is VALID [2018-11-23 11:59:05,147 INFO L256 TraceCheckUtils]: 33: Hoare triple {1075#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1075#false} is VALID [2018-11-23 11:59:05,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2018-11-23 11:59:05,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 11:59:05,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 11:59:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:59:05,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:05,150 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:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:05,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:05,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:05,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 11:59:05,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1074#true} is VALID [2018-11-23 11:59:05,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 11:59:05,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #119#return; {1074#true} is VALID [2018-11-23 11:59:05,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret15 := main(); {1074#true} is VALID [2018-11-23 11:59:05,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#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);havoc ~a~0;~a~0 := 0; {1097#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {1097#(<= 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; {1097#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:05,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {1097#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(<= 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; {1077#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:05,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:05,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#false} havoc ~i~0;~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1075#false} is VALID [2018-11-23 11:59:05,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1075#false} is VALID [2018-11-23 11:59:05,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {1075#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1075#false} is VALID [2018-11-23 11:59:05,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {1075#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1075#false} is VALID [2018-11-23 11:59:05,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {1075#false} ~i~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {1075#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; {1075#false} is VALID [2018-11-23 11:59:05,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {1075#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1075#false} is VALID [2018-11-23 11:59:05,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {1075#false} assume !(~i~0 < 100000); {1075#false} is VALID [2018-11-23 11:59:05,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {1075#false} havoc ~x~0;~x~0 := 0; {1075#false} is VALID [2018-11-23 11:59:05,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {1075#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1075#false} is VALID [2018-11-23 11:59:05,401 INFO L256 TraceCheckUtils]: 33: Hoare triple {1075#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1075#false} is VALID [2018-11-23 11:59:05,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2018-11-23 11:59:05,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 11:59:05,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 11:59:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:59:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:59:05,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:59:05,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:59:05,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:59:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:59:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:59:05,533 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-11-23 11:59:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,745 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-23 11:59:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:59:05,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:59:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:59:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:59:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:59:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:59:05,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2018-11-23 11:59:05,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,839 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:59:05,839 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:59:05,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:59:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:59:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:59:05,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:05,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:05,867 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:05,867 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:59:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,869 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:59:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:59:05,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,870 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:05,870 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:59:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:05,873 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:59:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:59:05,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:05,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:05,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:05,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:59:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 11:59:05,876 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 37 [2018-11-23 11:59:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 11:59:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:59:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 11:59:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:59:05,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:05,878 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:05,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:05,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 246203558, now seen corresponding path program 3 times [2018-11-23 11:59:05,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {1455#true} call ULTIMATE.init(); {1455#true} is VALID [2018-11-23 11:59:06,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {1455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1455#true} is VALID [2018-11-23 11:59:06,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1455#true} assume true; {1455#true} is VALID [2018-11-23 11:59:06,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1455#true} {1455#true} #119#return; {1455#true} is VALID [2018-11-23 11:59:06,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1455#true} call #t~ret15 := main(); {1455#true} is VALID [2018-11-23 11:59:06,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {1455#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);havoc ~a~0;~a~0 := 0; {1457#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {1457#(= 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; {1457#(= main_~a~0 0)} is VALID [2018-11-23 11:59:06,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {1457#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1458#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {1458#(<= 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; {1458#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:06,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {1458#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1459#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {1459#(<= 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; {1459#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:06,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {1459#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1460#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:06,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {1460#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#false} havoc ~i~0;~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1456#false} is VALID [2018-11-23 11:59:06,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1456#false} is VALID [2018-11-23 11:59:06,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1456#false} is VALID [2018-11-23 11:59:06,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1456#false} is VALID [2018-11-23 11:59:06,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,033 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1456#false} is VALID [2018-11-23 11:59:06,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {1456#false} havoc ~x~0;~x~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,034 INFO L273 TraceCheckUtils]: 34: Hoare triple {1456#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1456#false} is VALID [2018-11-23 11:59:06,034 INFO L256 TraceCheckUtils]: 35: Hoare triple {1456#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1456#false} is VALID [2018-11-23 11:59:06,035 INFO L273 TraceCheckUtils]: 36: Hoare triple {1456#false} ~cond := #in~cond; {1456#false} is VALID [2018-11-23 11:59:06,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {1456#false} assume 0 == ~cond; {1456#false} is VALID [2018-11-23 11:59:06,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {1456#false} assume !false; {1456#false} is VALID [2018-11-23 11:59:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:59:06,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:06,038 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:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:06,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:59:06,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:06,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:06,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {1455#true} call ULTIMATE.init(); {1455#true} is VALID [2018-11-23 11:59:06,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {1455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1455#true} is VALID [2018-11-23 11:59:06,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {1455#true} assume true; {1455#true} is VALID [2018-11-23 11:59:06,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1455#true} {1455#true} #119#return; {1455#true} is VALID [2018-11-23 11:59:06,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1455#true} call #t~ret15 := main(); {1455#true} is VALID [2018-11-23 11:59:06,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {1455#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);havoc ~a~0;~a~0 := 0; {1455#true} is VALID [2018-11-23 11:59:06,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {1455#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; {1455#true} is VALID [2018-11-23 11:59:06,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:59:06,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1455#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; {1455#true} is VALID [2018-11-23 11:59:06,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:59:06,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {1455#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; {1455#true} is VALID [2018-11-23 11:59:06,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {1455#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1455#true} is VALID [2018-11-23 11:59:06,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1455#true} assume !(~a~0 < 100000); {1455#true} is VALID [2018-11-23 11:59:06,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1455#true} havoc ~i~0;~i~0 := 0; {1455#true} is VALID [2018-11-23 11:59:06,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {1455#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; {1455#true} is VALID [2018-11-23 11:59:06,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1455#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1455#true} is VALID [2018-11-23 11:59:06,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {1455#true} assume !(~i~0 < 100000); {1455#true} is VALID [2018-11-23 11:59:06,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {1455#true} ~i~0 := 0; {1515#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {1515#(<= 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; {1515#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:06,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {1515#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1522#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:06,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {1522#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1456#false} is VALID [2018-11-23 11:59:06,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1456#false} is VALID [2018-11-23 11:59:06,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#false} ~i~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#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; {1456#false} is VALID [2018-11-23 11:59:06,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1456#false} is VALID [2018-11-23 11:59:06,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {1456#false} assume !(~i~0 < 100000); {1456#false} is VALID [2018-11-23 11:59:06,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {1456#false} havoc ~x~0;~x~0 := 0; {1456#false} is VALID [2018-11-23 11:59:06,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {1456#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1456#false} is VALID [2018-11-23 11:59:06,209 INFO L256 TraceCheckUtils]: 35: Hoare triple {1456#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1456#false} is VALID [2018-11-23 11:59:06,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {1456#false} ~cond := #in~cond; {1456#false} is VALID [2018-11-23 11:59:06,210 INFO L273 TraceCheckUtils]: 37: Hoare triple {1456#false} assume 0 == ~cond; {1456#false} is VALID [2018-11-23 11:59:06,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {1456#false} assume !false; {1456#false} is VALID [2018-11-23 11:59:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:59:06,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 11:59:06,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-23 11:59:06,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:06,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:06,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:06,310 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 8 states. [2018-11-23 11:59:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,770 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2018-11-23 11:59:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:59:06,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-23 11:59:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2018-11-23 11:59:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2018-11-23 11:59:06,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 105 transitions. [2018-11-23 11:59:07,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,002 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:59:07,002 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:59:07,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:59:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-11-23 11:59:07,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:07,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 56 states. [2018-11-23 11:59:07,129 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 56 states. [2018-11-23 11:59:07,129 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 56 states. [2018-11-23 11:59:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,132 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 11:59:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-23 11:59:07,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,133 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 62 states. [2018-11-23 11:59:07,133 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 62 states. [2018-11-23 11:59:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:07,136 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-23 11:59:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-23 11:59:07,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:07,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:07,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:07,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:59:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-23 11:59:07,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 39 [2018-11-23 11:59:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:07,139 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-23 11:59:07,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 11:59:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:59:07,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:07,141 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 11:59:07,141 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:07,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 575548698, now seen corresponding path program 4 times [2018-11-23 11:59:07,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:07,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {1919#true} call ULTIMATE.init(); {1919#true} is VALID [2018-11-23 11:59:07,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {1919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1919#true} is VALID [2018-11-23 11:59:07,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {1919#true} assume true; {1919#true} is VALID [2018-11-23 11:59:07,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1919#true} {1919#true} #119#return; {1919#true} is VALID [2018-11-23 11:59:07,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {1919#true} call #t~ret15 := main(); {1919#true} is VALID [2018-11-23 11:59:07,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1919#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);havoc ~a~0;~a~0 := 0; {1921#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {1921#(= 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; {1921#(= main_~a~0 0)} is VALID [2018-11-23 11:59:07,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {1921#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {1922#(<= 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; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {1922#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(<= 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; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {1924#(<= 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; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {1924#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1925#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {1925#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#false} havoc ~i~0;~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {1920#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1920#false} is VALID [2018-11-23 11:59:07,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {1920#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1920#false} is VALID [2018-11-23 11:59:07,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {1920#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1920#false} is VALID [2018-11-23 11:59:07,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,450 INFO L273 TraceCheckUtils]: 25: Hoare triple {1920#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1920#false} is VALID [2018-11-23 11:59:07,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {1920#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 30: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {1920#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {1920#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1920#false} is VALID [2018-11-23 11:59:07,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {1920#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1920#false} is VALID [2018-11-23 11:59:07,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {1920#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1920#false} is VALID [2018-11-23 11:59:07,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,453 INFO L273 TraceCheckUtils]: 43: Hoare triple {1920#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1920#false} is VALID [2018-11-23 11:59:07,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {1920#false} havoc ~x~0;~x~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {1920#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L256 TraceCheckUtils]: 47: Hoare triple {1920#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {1920#false} ~cond := #in~cond; {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {1920#false} assume 0 == ~cond; {1920#false} is VALID [2018-11-23 11:59:07,454 INFO L273 TraceCheckUtils]: 50: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2018-11-23 11:59:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:59:07,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,457 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:07,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:07,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:07,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {1919#true} call ULTIMATE.init(); {1919#true} is VALID [2018-11-23 11:59:07,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {1919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1919#true} is VALID [2018-11-23 11:59:07,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {1919#true} assume true; {1919#true} is VALID [2018-11-23 11:59:07,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1919#true} {1919#true} #119#return; {1919#true} is VALID [2018-11-23 11:59:07,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {1919#true} call #t~ret15 := main(); {1919#true} is VALID [2018-11-23 11:59:07,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {1919#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);havoc ~a~0;~a~0 := 0; {1944#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:07,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {1944#(<= 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; {1944#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {1944#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {1922#(<= 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; {1922#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {1922#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(<= 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; {1923#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:07,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {1924#(<= 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; {1924#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {1924#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1925#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {1925#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#false} havoc ~i~0;~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {1920#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1920#false} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {1920#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1920#false} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {1920#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {1920#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1920#false} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {1920#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1920#false} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {1920#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {1920#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {1920#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1920#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {1920#false} ~i~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {1920#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1920#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 42: Hoare triple {1920#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; {1920#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {1920#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1920#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {1920#false} assume !(~i~0 < 100000); {1920#false} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {1920#false} havoc ~x~0;~x~0 := 0; {1920#false} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 46: Hoare triple {1920#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {1920#false} is VALID [2018-11-23 11:59:07,747 INFO L256 TraceCheckUtils]: 47: Hoare triple {1920#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {1920#false} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {1920#false} ~cond := #in~cond; {1920#false} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {1920#false} assume 0 == ~cond; {1920#false} is VALID [2018-11-23 11:59:07,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2018-11-23 11:59:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:59:07,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:59:07,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 11:59:07,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:59:07,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:07,826 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 8 states. [2018-11-23 11:59:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,260 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-11-23 11:59:08,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:08,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 11:59:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-23 11:59:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:59:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-23 11:59:08,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2018-11-23 11:59:08,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:08,438 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:59:08,439 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:59:08,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:59:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:59:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 11:59:08,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:08,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:08,468 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:08,468 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 11:59:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,472 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 11:59:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 11:59:08,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,472 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 11:59:08,473 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 11:59:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,475 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 11:59:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 11:59:08,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:08,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:08,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:08,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:59:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 11:59:08,477 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 51 [2018-11-23 11:59:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 11:59:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:59:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:59:08,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:08,479 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 11:59:08,480 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:08,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -801206728, now seen corresponding path program 5 times [2018-11-23 11:59:08,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:08,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2018-11-23 11:59:08,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {2429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2429#true} is VALID [2018-11-23 11:59:08,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {2429#true} assume true; {2429#true} is VALID [2018-11-23 11:59:08,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2429#true} {2429#true} #119#return; {2429#true} is VALID [2018-11-23 11:59:08,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {2429#true} call #t~ret15 := main(); {2429#true} is VALID [2018-11-23 11:59:08,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {2429#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);havoc ~a~0;~a~0 := 0; {2431#(= main_~a~0 0)} is VALID [2018-11-23 11:59:08,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {2431#(= 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; {2431#(= main_~a~0 0)} is VALID [2018-11-23 11:59:08,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {2431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2432#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:08,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {2432#(<= 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; {2432#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:08,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {2432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2433#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:08,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {2433#(<= 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; {2433#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:08,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {2433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2434#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:08,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {2434#(<= 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; {2434#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:08,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {2434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2435#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:08,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2435#(<= 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; {2435#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:08,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {2435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2436#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {2436#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {2430#false} havoc ~i~0;~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {2430#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2430#false} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {2430#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {2430#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {2430#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2430#false} is VALID [2018-11-23 11:59:08,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,709 INFO L273 TraceCheckUtils]: 29: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {2430#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {2430#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 37: Hoare triple {2430#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2430#false} is VALID [2018-11-23 11:59:08,710 INFO L273 TraceCheckUtils]: 38: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {2430#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 42: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {2430#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:08,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {2430#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {2430#false} havoc ~x~0;~x~0 := 0; {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L273 TraceCheckUtils]: 48: Hoare triple {2430#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L256 TraceCheckUtils]: 49: Hoare triple {2430#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {2430#false} ~cond := #in~cond; {2430#false} is VALID [2018-11-23 11:59:08,712 INFO L273 TraceCheckUtils]: 51: Hoare triple {2430#false} assume 0 == ~cond; {2430#false} is VALID [2018-11-23 11:59:08,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2018-11-23 11:59:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:59:08,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:08,714 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:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:09,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:59:09,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:09,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2018-11-23 11:59:09,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {2429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2429#true} is VALID [2018-11-23 11:59:09,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {2429#true} assume true; {2429#true} is VALID [2018-11-23 11:59:09,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2429#true} {2429#true} #119#return; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {2429#true} call #t~ret15 := main(); {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {2429#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);havoc ~a~0;~a~0 := 0; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:59:09,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:59:09,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:59:09,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {2429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {2429#true} assume !(~a~0 < 100000); {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {2429#true} havoc ~i~0;~i~0 := 0; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {2429#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {2429#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; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {2429#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2429#true} is VALID [2018-11-23 11:59:09,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {2429#true} assume !(~i~0 < 100000); {2429#true} is VALID [2018-11-23 11:59:09,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {2429#true} ~i~0 := 0; {2509#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#(<= 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; {2509#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:09,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2516#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {2516#(<= 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; {2516#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:09,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {2516#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2523#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {2523#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:09,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:09,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,583 INFO L273 TraceCheckUtils]: 31: Hoare triple {2430#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2430#false} is VALID [2018-11-23 11:59:09,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {2430#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {2430#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {2430#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2430#false} is VALID [2018-11-23 11:59:09,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:09,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {2430#false} ~i~0 := 0; {2430#false} is VALID [2018-11-23 11:59:09,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,585 INFO L273 TraceCheckUtils]: 43: Hoare triple {2430#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2430#false} is VALID [2018-11-23 11:59:09,585 INFO L273 TraceCheckUtils]: 44: Hoare triple {2430#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; {2430#false} is VALID [2018-11-23 11:59:09,586 INFO L273 TraceCheckUtils]: 45: Hoare triple {2430#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2430#false} is VALID [2018-11-23 11:59:09,586 INFO L273 TraceCheckUtils]: 46: Hoare triple {2430#false} assume !(~i~0 < 100000); {2430#false} is VALID [2018-11-23 11:59:09,586 INFO L273 TraceCheckUtils]: 47: Hoare triple {2430#false} havoc ~x~0;~x~0 := 0; {2430#false} is VALID [2018-11-23 11:59:09,586 INFO L273 TraceCheckUtils]: 48: Hoare triple {2430#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {2430#false} is VALID [2018-11-23 11:59:09,587 INFO L256 TraceCheckUtils]: 49: Hoare triple {2430#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {2430#false} is VALID [2018-11-23 11:59:09,587 INFO L273 TraceCheckUtils]: 50: Hoare triple {2430#false} ~cond := #in~cond; {2430#false} is VALID [2018-11-23 11:59:09,587 INFO L273 TraceCheckUtils]: 51: Hoare triple {2430#false} assume 0 == ~cond; {2430#false} is VALID [2018-11-23 11:59:09,587 INFO L273 TraceCheckUtils]: 52: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2018-11-23 11:59:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 11:59:09,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:09,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 11:59:09,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-23 11:59:09,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:09,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:09,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:09,814 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 11 states. [2018-11-23 11:59:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,401 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2018-11-23 11:59:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:10,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-23 11:59:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-23 11:59:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2018-11-23 11:59:10,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 119 transitions. [2018-11-23 11:59:10,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:10,652 INFO L225 Difference]: With dead ends: 117 [2018-11-23 11:59:10,652 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:59:10,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:59:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-11-23 11:59:10,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:10,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 70 states. [2018-11-23 11:59:10,679 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 70 states. [2018-11-23 11:59:10,679 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 70 states. [2018-11-23 11:59:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,682 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:59:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:59:10,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,683 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 76 states. [2018-11-23 11:59:10,683 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 76 states. [2018-11-23 11:59:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:10,685 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:59:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:59:10,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:10,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:10,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:10,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:59:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-23 11:59:10,687 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-11-23 11:59:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:10,688 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-23 11:59:10,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 11:59:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:59:10,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:10,689 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 11:59:10,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:10,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash -371655764, now seen corresponding path program 6 times [2018-11-23 11:59:10,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:10,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {3023#true} call ULTIMATE.init(); {3023#true} is VALID [2018-11-23 11:59:10,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {3023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3023#true} is VALID [2018-11-23 11:59:10,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {3023#true} assume true; {3023#true} is VALID [2018-11-23 11:59:10,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3023#true} {3023#true} #119#return; {3023#true} is VALID [2018-11-23 11:59:10,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {3023#true} call #t~ret15 := main(); {3023#true} is VALID [2018-11-23 11:59:10,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {3023#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);havoc ~a~0;~a~0 := 0; {3025#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {3025#(= 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; {3025#(= main_~a~0 0)} is VALID [2018-11-23 11:59:10,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {3025#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3026#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {3026#(<= 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; {3026#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:10,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {3026#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3027#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {3027#(<= 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; {3027#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:10,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {3027#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3028#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {3028#(<= 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; {3028#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:10,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {3028#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3029#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {3029#(<= 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; {3029#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:10,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {3029#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3030#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {3030#(<= 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; {3030#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:10,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {3030#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3031#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {3031#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {3024#false} havoc ~i~0;~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {3024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3024#false} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {3024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3024#false} is VALID [2018-11-23 11:59:10,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {3024#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3024#false} is VALID [2018-11-23 11:59:10,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:10,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:10,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:10,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,905 INFO L273 TraceCheckUtils]: 36: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,905 INFO L273 TraceCheckUtils]: 37: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:10,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:10,906 INFO L273 TraceCheckUtils]: 40: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:10,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 46: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:10,907 INFO L273 TraceCheckUtils]: 48: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:10,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,908 INFO L273 TraceCheckUtils]: 51: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 56: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 57: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:10,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {3024#false} havoc ~x~0;~x~0 := 0; {3024#false} is VALID [2018-11-23 11:59:10,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {3024#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3024#false} is VALID [2018-11-23 11:59:10,910 INFO L256 TraceCheckUtils]: 61: Hoare triple {3024#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {3024#false} is VALID [2018-11-23 11:59:10,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {3024#false} ~cond := #in~cond; {3024#false} is VALID [2018-11-23 11:59:10,910 INFO L273 TraceCheckUtils]: 63: Hoare triple {3024#false} assume 0 == ~cond; {3024#false} is VALID [2018-11-23 11:59:10,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {3024#false} assume !false; {3024#false} is VALID [2018-11-23 11:59:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:59:10,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:10,914 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:10,923 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:11,109 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:59:11,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:11,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:11,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {3023#true} call ULTIMATE.init(); {3023#true} is VALID [2018-11-23 11:59:11,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {3023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3023#true} is VALID [2018-11-23 11:59:11,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {3023#true} assume true; {3023#true} is VALID [2018-11-23 11:59:11,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3023#true} {3023#true} #119#return; {3023#true} is VALID [2018-11-23 11:59:11,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {3023#true} call #t~ret15 := main(); {3023#true} is VALID [2018-11-23 11:59:11,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {3023#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);havoc ~a~0;~a~0 := 0; {3023#true} is VALID [2018-11-23 11:59:11,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {3023#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; {3023#true} is VALID [2018-11-23 11:59:11,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {3023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3023#true} is VALID [2018-11-23 11:59:11,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {3023#true} assume !(~a~0 < 100000); {3023#true} is VALID [2018-11-23 11:59:11,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {3023#true} havoc ~i~0;~i~0 := 0; {3092#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {3092#(<= 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; {3092#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:11,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {3092#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3099#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {3099#(<= 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; {3099#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:11,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {3099#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3106#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {3106#(<= 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; {3106#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:11,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {3106#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3113#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:11,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {3113#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:11,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:11,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:11,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,597 INFO L273 TraceCheckUtils]: 31: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:11,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {3024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3024#false} is VALID [2018-11-23 11:59:11,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:11,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:11,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:11,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 41: Hoare triple {3024#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:11,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {3024#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 50: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {3024#false} ~i~0 := 0; {3024#false} is VALID [2018-11-23 11:59:11,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 56: Hoare triple {3024#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; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 57: Hoare triple {3024#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 58: Hoare triple {3024#false} assume !(~i~0 < 100000); {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {3024#false} havoc ~x~0;~x~0 := 0; {3024#false} is VALID [2018-11-23 11:59:11,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {3024#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3024#false} is VALID [2018-11-23 11:59:11,602 INFO L256 TraceCheckUtils]: 61: Hoare triple {3024#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {3024#false} is VALID [2018-11-23 11:59:11,602 INFO L273 TraceCheckUtils]: 62: Hoare triple {3024#false} ~cond := #in~cond; {3024#false} is VALID [2018-11-23 11:59:11,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {3024#false} assume 0 == ~cond; {3024#false} is VALID [2018-11-23 11:59:11,602 INFO L273 TraceCheckUtils]: 64: Hoare triple {3024#false} assume !false; {3024#false} is VALID [2018-11-23 11:59:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:59:11,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:11,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:59:11,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 11:59:11,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:11,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:59:11,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:59:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:59:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:11,697 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 13 states. [2018-11-23 11:59:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,268 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-11-23 11:59:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:12,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 11:59:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 11:59:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:59:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 11:59:12,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 131 transitions. [2018-11-23 11:59:12,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:12,454 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:59:12,454 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:59:12,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:59:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2018-11-23 11:59:12,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:12,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 82 states. [2018-11-23 11:59:12,491 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 82 states. [2018-11-23 11:59:12,491 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 82 states. [2018-11-23 11:59:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,495 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:59:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:59:12,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,496 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 88 states. [2018-11-23 11:59:12,496 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 88 states. [2018-11-23 11:59:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:12,499 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:59:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:59:12,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:12,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:12,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:12,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:59:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 11:59:12,503 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 65 [2018-11-23 11:59:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:12,503 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 11:59:12,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:59:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 11:59:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:59:12,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:12,504 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 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] [2018-11-23 11:59:12,505 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:12,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash 996125472, now seen corresponding path program 7 times [2018-11-23 11:59:12,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {3730#true} call ULTIMATE.init(); {3730#true} is VALID [2018-11-23 11:59:12,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {3730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3730#true} is VALID [2018-11-23 11:59:12,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {3730#true} assume true; {3730#true} is VALID [2018-11-23 11:59:12,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3730#true} {3730#true} #119#return; {3730#true} is VALID [2018-11-23 11:59:12,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {3730#true} call #t~ret15 := main(); {3730#true} is VALID [2018-11-23 11:59:12,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {3730#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);havoc ~a~0;~a~0 := 0; {3732#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {3732#(= 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; {3732#(= main_~a~0 0)} is VALID [2018-11-23 11:59:12,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {3732#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {3733#(<= 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; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {3733#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {3734#(<= 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; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:12,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {3734#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {3735#(<= 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; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:12,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {3735#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {3736#(<= 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; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:12,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {3736#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {3737#(<= 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; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:12,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {3737#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {3738#(<= 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; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:12,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {3738#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3739#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:12,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {3739#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {3731#false} havoc ~i~0;~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:12,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:12,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:12,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:12,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:12,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:12,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:12,706 INFO L273 TraceCheckUtils]: 50: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:12,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:12,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:12,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:12,710 INFO L273 TraceCheckUtils]: 71: Hoare triple {3731#false} havoc ~x~0;~x~0 := 0; {3731#false} is VALID [2018-11-23 11:59:12,710 INFO L273 TraceCheckUtils]: 72: Hoare triple {3731#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3731#false} is VALID [2018-11-23 11:59:12,710 INFO L256 TraceCheckUtils]: 73: Hoare triple {3731#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {3731#false} is VALID [2018-11-23 11:59:12,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {3731#false} ~cond := #in~cond; {3731#false} is VALID [2018-11-23 11:59:12,710 INFO L273 TraceCheckUtils]: 75: Hoare triple {3731#false} assume 0 == ~cond; {3731#false} is VALID [2018-11-23 11:59:12,711 INFO L273 TraceCheckUtils]: 76: Hoare triple {3731#false} assume !false; {3731#false} is VALID [2018-11-23 11:59:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:59:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,714 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:12,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:12,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {3730#true} call ULTIMATE.init(); {3730#true} is VALID [2018-11-23 11:59:12,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {3730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3730#true} is VALID [2018-11-23 11:59:12,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {3730#true} assume true; {3730#true} is VALID [2018-11-23 11:59:12,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3730#true} {3730#true} #119#return; {3730#true} is VALID [2018-11-23 11:59:12,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {3730#true} call #t~ret15 := main(); {3730#true} is VALID [2018-11-23 11:59:12,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {3730#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);havoc ~a~0;~a~0 := 0; {3758#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:12,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {3758#(<= 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; {3758#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:12,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {3758#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {3733#(<= 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; {3733#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:12,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {3733#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {3734#(<= 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; {3734#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {3734#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {3735#(<= 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; {3735#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {3735#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {3736#(<= 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; {3736#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {3736#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {3737#(<= 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; {3737#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {3737#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {3738#(<= 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; {3738#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {3738#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3739#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:13,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {3739#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {3731#false} havoc ~i~0;~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {3731#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 31: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {3731#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,016 INFO L273 TraceCheckUtils]: 43: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {3731#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,018 INFO L273 TraceCheckUtils]: 59: Hoare triple {3731#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 60: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {3731#false} ~i~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 65: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:13,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {3731#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; {3731#false} is VALID [2018-11-23 11:59:13,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {3731#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3731#false} is VALID [2018-11-23 11:59:13,020 INFO L273 TraceCheckUtils]: 70: Hoare triple {3731#false} assume !(~i~0 < 100000); {3731#false} is VALID [2018-11-23 11:59:13,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {3731#false} havoc ~x~0;~x~0 := 0; {3731#false} is VALID [2018-11-23 11:59:13,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {3731#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {3731#false} is VALID [2018-11-23 11:59:13,020 INFO L256 TraceCheckUtils]: 73: Hoare triple {3731#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {3731#false} is VALID [2018-11-23 11:59:13,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {3731#false} ~cond := #in~cond; {3731#false} is VALID [2018-11-23 11:59:13,021 INFO L273 TraceCheckUtils]: 75: Hoare triple {3731#false} assume 0 == ~cond; {3731#false} is VALID [2018-11-23 11:59:13,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {3731#false} assume !false; {3731#false} is VALID [2018-11-23 11:59:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:59:13,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:59:13,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:59:13,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:59:13,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:13,159 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 11 states. [2018-11-23 11:59:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,602 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-11-23 11:59:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:59:13,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 11:59:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:59:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:59:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2018-11-23 11:59:13,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2018-11-23 11:59:13,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,725 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:59:13,726 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:59:13,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:59:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:59:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:59:13,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:13,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:13,767 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:13,767 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:59:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,769 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-23 11:59:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 11:59:13,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:13,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:13,770 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:13,770 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:59:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:13,771 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-23 11:59:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 11:59:13,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:13,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:13,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:13,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:59:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-11-23 11:59:13,774 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 77 [2018-11-23 11:59:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:13,775 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-11-23 11:59:13,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-11-23 11:59:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:59:13,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:13,776 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 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] [2018-11-23 11:59:13,776 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:13,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -869743938, now seen corresponding path program 8 times [2018-11-23 11:59:13,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:13,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 11:59:13,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 11:59:13,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 11:59:13,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #119#return; {4481#true} is VALID [2018-11-23 11:59:13,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret15 := main(); {4481#true} is VALID [2018-11-23 11:59:13,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#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);havoc ~a~0;~a~0 := 0; {4483#(= main_~a~0 0)} is VALID [2018-11-23 11:59:13,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#(= 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; {4483#(= main_~a~0 0)} is VALID [2018-11-23 11:59:13,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {4483#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {4484#(<= 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; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:13,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {4484#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {4485#(<= 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; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:13,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {4485#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(<= 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; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:13,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {4487#(<= 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; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:13,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= 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; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:13,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {4489#(<= 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; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:13,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {4489#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:13,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {4490#(<= 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; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:13,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {4490#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4491#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:13,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {4482#false} havoc ~i~0;~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,967 INFO L273 TraceCheckUtils]: 25: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:13,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:13,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:13,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:13,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:13,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:13,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 49: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:13,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 54: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 55: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:13,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 60: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,974 INFO L273 TraceCheckUtils]: 64: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 65: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 66: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 67: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 68: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:13,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {4482#false} havoc ~x~0;~x~0 := 0; {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L273 TraceCheckUtils]: 74: Hoare triple {4482#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L256 TraceCheckUtils]: 75: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {4482#false} is VALID [2018-11-23 11:59:13,976 INFO L273 TraceCheckUtils]: 76: Hoare triple {4482#false} ~cond := #in~cond; {4482#false} is VALID [2018-11-23 11:59:13,977 INFO L273 TraceCheckUtils]: 77: Hoare triple {4482#false} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 11:59:13,977 INFO L273 TraceCheckUtils]: 78: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 11:59:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:59:13,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:13,981 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:13,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:14,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:14,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:14,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:14,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {4481#true} call ULTIMATE.init(); {4481#true} is VALID [2018-11-23 11:59:14,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {4481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4481#true} is VALID [2018-11-23 11:59:14,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {4481#true} assume true; {4481#true} is VALID [2018-11-23 11:59:14,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4481#true} {4481#true} #119#return; {4481#true} is VALID [2018-11-23 11:59:14,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {4481#true} call #t~ret15 := main(); {4481#true} is VALID [2018-11-23 11:59:14,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {4481#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);havoc ~a~0;~a~0 := 0; {4510#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:14,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {4510#(<= 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; {4510#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:14,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {4510#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {4484#(<= 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; {4484#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:14,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {4484#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {4485#(<= 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; {4485#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:14,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {4485#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(<= 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; {4486#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:14,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {4487#(<= 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; {4487#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:14,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {4487#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#(<= 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; {4488#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:14,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {4489#(<= 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; {4489#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:14,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {4489#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:14,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {4490#(<= 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; {4490#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:14,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {4490#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4491#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:14,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {4482#false} havoc ~i~0;~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:14,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:14,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:14,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {4482#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4482#false} is VALID [2018-11-23 11:59:14,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {4482#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 49: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {4482#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4482#false} is VALID [2018-11-23 11:59:14,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:14,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {4482#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {4482#false} ~i~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 68: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 69: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {4482#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; {4482#false} is VALID [2018-11-23 11:59:14,246 INFO L273 TraceCheckUtils]: 71: Hoare triple {4482#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {4482#false} assume !(~i~0 < 100000); {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {4482#false} havoc ~x~0;~x~0 := 0; {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {4482#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L256 TraceCheckUtils]: 75: Hoare triple {4482#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {4482#false} ~cond := #in~cond; {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {4482#false} assume 0 == ~cond; {4482#false} is VALID [2018-11-23 11:59:14,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {4482#false} assume !false; {4482#false} is VALID [2018-11-23 11:59:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:59:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:14,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:59:14,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 11:59:14,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:14,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:59:14,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:14,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:59:14,327 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 12 states. [2018-11-23 11:59:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,689 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-11-23 11:59:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:59:14,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 11:59:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 11:59:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:59:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2018-11-23 11:59:14,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 90 transitions. [2018-11-23 11:59:15,291 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:15,293 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:59:15,294 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 11:59:15,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 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:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 11:59:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 11:59:15,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 11:59:15,384 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 11:59:15,384 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 11:59:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,386 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-23 11:59:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 11:59:15,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,387 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 11:59:15,387 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 11:59:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,389 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-23 11:59:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 11:59:15,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:59:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-11-23 11:59:15,391 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 79 [2018-11-23 11:59:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,391 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-11-23 11:59:15,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-11-23 11:59:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 11:59:15,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,392 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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] [2018-11-23 11:59:15,392 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1326082780, now seen corresponding path program 9 times [2018-11-23 11:59:15,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2018-11-23 11:59:16,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5249#true} is VALID [2018-11-23 11:59:16,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2018-11-23 11:59:16,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #119#return; {5249#true} is VALID [2018-11-23 11:59:16,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret15 := main(); {5249#true} is VALID [2018-11-23 11:59:16,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {5249#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);havoc ~a~0;~a~0 := 0; {5251#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {5251#(= 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; {5251#(= main_~a~0 0)} is VALID [2018-11-23 11:59:16,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {5251#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5252#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {5252#(<= 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; {5252#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:16,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {5252#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5253#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {5253#(<= 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; {5253#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:16,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {5253#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5254#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {5254#(<= 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; {5254#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:16,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {5254#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5255#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#(<= 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; {5255#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:16,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5256#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {5256#(<= 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; {5256#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:16,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {5256#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5257#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {5257#(<= 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; {5257#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:16,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {5257#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5258#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {5258#(<= 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; {5258#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:16,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {5258#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5259#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:16,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {5259#(<= 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; {5259#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:16,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {5259#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5260#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:16,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {5260#(<= main_~a~0 9)} assume !(~a~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {5250#false} havoc ~i~0;~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {5250#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5250#false} is VALID [2018-11-23 11:59:16,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {5250#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5250#false} is VALID [2018-11-23 11:59:16,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {5250#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5250#false} is VALID [2018-11-23 11:59:16,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {5250#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5250#false} is VALID [2018-11-23 11:59:16,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {5250#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {5250#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {5250#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5250#false} is VALID [2018-11-23 11:59:16,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {5250#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {5250#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {5250#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5250#false} is VALID [2018-11-23 11:59:16,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {5250#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {5250#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {5250#false} havoc ~x~0;~x~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {5250#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5250#false} is VALID [2018-11-23 11:59:16,217 INFO L256 TraceCheckUtils]: 77: Hoare triple {5250#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {5250#false} is VALID [2018-11-23 11:59:16,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2018-11-23 11:59:16,217 INFO L273 TraceCheckUtils]: 79: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2018-11-23 11:59:16,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2018-11-23 11:59:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 11:59:16,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,221 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:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:16,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:59:16,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2018-11-23 11:59:16,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5249#true} is VALID [2018-11-23 11:59:16,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2018-11-23 11:59:16,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #119#return; {5249#true} is VALID [2018-11-23 11:59:16,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret15 := main(); {5249#true} is VALID [2018-11-23 11:59:16,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {5249#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);havoc ~a~0;~a~0 := 0; {5249#true} is VALID [2018-11-23 11:59:16,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,469 INFO L273 TraceCheckUtils]: 11: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {5249#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#true} is VALID [2018-11-23 11:59:16,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {5249#true} assume !(~a~0 < 100000); {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 25: Hoare triple {5249#true} havoc ~i~0;~i~0 := 0; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {5249#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 29: Hoare triple {5249#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {5249#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {5249#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {5249#true} assume !(~i~0 < 100000); {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {5249#true} ~i~0 := 0; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {5249#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {5249#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {5249#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5249#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {5249#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; {5249#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {5249#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5249#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {5249#true} assume !(~i~0 < 100000); {5249#true} is VALID [2018-11-23 11:59:16,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {5249#true} ~i~0 := 0; {5399#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {5399#(<= 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; {5399#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:16,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {5399#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5406#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {5406#(<= 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; {5406#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:16,476 INFO L273 TraceCheckUtils]: 49: Hoare triple {5406#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5413#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,476 INFO L273 TraceCheckUtils]: 50: Hoare triple {5413#(<= 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; {5413#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,477 INFO L273 TraceCheckUtils]: 51: Hoare triple {5413#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5420#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,477 INFO L273 TraceCheckUtils]: 52: Hoare triple {5420#(<= 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; {5420#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {5420#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5427#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {5427#(<= main_~i~0 4)} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,479 INFO L273 TraceCheckUtils]: 56: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {5250#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {5250#false} is VALID [2018-11-23 11:59:16,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {5250#false} ~i~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 70: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 71: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 72: Hoare triple {5250#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; {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {5250#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {5250#false} assume !(~i~0 < 100000); {5250#false} is VALID [2018-11-23 11:59:16,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {5250#false} havoc ~x~0;~x~0 := 0; {5250#false} is VALID [2018-11-23 11:59:16,483 INFO L273 TraceCheckUtils]: 76: Hoare triple {5250#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {5250#false} is VALID [2018-11-23 11:59:16,483 INFO L256 TraceCheckUtils]: 77: Hoare triple {5250#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {5250#false} is VALID [2018-11-23 11:59:16,483 INFO L273 TraceCheckUtils]: 78: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2018-11-23 11:59:16,483 INFO L273 TraceCheckUtils]: 79: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2018-11-23 11:59:16,483 INFO L273 TraceCheckUtils]: 80: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2018-11-23 11:59:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 11:59:16,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 11:59:16,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 11:59:16,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:59:16,578 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:16,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:59:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:59:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:16,579 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 17 states. [2018-11-23 11:59:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,663 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-11-23 11:59:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:17,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-23 11:59:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2018-11-23 11:59:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:59:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2018-11-23 11:59:17,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 147 transitions. [2018-11-23 11:59:18,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:18,663 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:59:18,663 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:59:18,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:59:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:59:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-11-23 11:59:18,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:18,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 98 states. [2018-11-23 11:59:18,786 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 98 states. [2018-11-23 11:59:18,786 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 98 states. [2018-11-23 11:59:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,789 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-11-23 11:59:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-11-23 11:59:18,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,790 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 104 states. [2018-11-23 11:59:18,790 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 104 states. [2018-11-23 11:59:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:18,792 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-11-23 11:59:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-11-23 11:59:18,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:18,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:18,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:18,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:59:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-11-23 11:59:18,795 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 81 [2018-11-23 11:59:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:18,795 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-11-23 11:59:18,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:59:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-11-23 11:59:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:59:18,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:18,796 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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] [2018-11-23 11:59:18,796 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:18,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1218403760, now seen corresponding path program 10 times [2018-11-23 11:59:18,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2018-11-23 11:59:19,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {6103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6103#true} is VALID [2018-11-23 11:59:19,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2018-11-23 11:59:19,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #119#return; {6103#true} is VALID [2018-11-23 11:59:19,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret15 := main(); {6103#true} is VALID [2018-11-23 11:59:19,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {6103#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);havoc ~a~0;~a~0 := 0; {6105#(= main_~a~0 0)} is VALID [2018-11-23 11:59:19,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {6105#(= 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; {6105#(= main_~a~0 0)} is VALID [2018-11-23 11:59:19,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {6105#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6106#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:19,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {6106#(<= 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; {6106#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:19,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {6106#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6107#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:19,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {6107#(<= 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; {6107#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:19,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {6107#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6108#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:19,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {6108#(<= 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; {6108#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:19,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {6108#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6109#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:19,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {6109#(<= 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; {6109#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:19,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {6109#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6110#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:19,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {6110#(<= 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; {6110#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:19,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {6110#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6111#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:19,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {6111#(<= 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; {6111#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:19,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {6111#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6112#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:19,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {6112#(<= 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; {6112#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:19,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {6112#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6113#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:19,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {6113#(<= 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; {6113#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:19,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {6113#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6114#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:19,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {6114#(<= 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; {6114#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:19,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {6114#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6115#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:19,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {6115#(<= main_~a~0 10)} assume !(~a~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {6104#false} havoc ~i~0;~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 57: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 58: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 60: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 61: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 62: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 64: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 65: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 71: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 81: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 82: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 83: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,250 INFO L273 TraceCheckUtils]: 84: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 85: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 86: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 87: Hoare triple {6104#false} havoc ~x~0;~x~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 88: Hoare triple {6104#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L256 TraceCheckUtils]: 89: Hoare triple {6104#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 90: Hoare triple {6104#false} ~cond := #in~cond; {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 91: Hoare triple {6104#false} assume 0 == ~cond; {6104#false} is VALID [2018-11-23 11:59:19,251 INFO L273 TraceCheckUtils]: 92: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2018-11-23 11:59:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-23 11:59:19,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:19,255 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 11:59:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:19,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:19,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:19,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {6103#true} call ULTIMATE.init(); {6103#true} is VALID [2018-11-23 11:59:19,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {6103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6103#true} is VALID [2018-11-23 11:59:19,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {6103#true} assume true; {6103#true} is VALID [2018-11-23 11:59:19,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6103#true} {6103#true} #119#return; {6103#true} is VALID [2018-11-23 11:59:19,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {6103#true} call #t~ret15 := main(); {6103#true} is VALID [2018-11-23 11:59:19,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {6103#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);havoc ~a~0;~a~0 := 0; {6134#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:19,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {6134#(<= 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; {6134#(<= main_~a~0 0)} is VALID [2018-11-23 11:59:19,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {6134#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6106#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:19,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {6106#(<= 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; {6106#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:19,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {6106#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6107#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:19,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {6107#(<= 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; {6107#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:19,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {6107#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6108#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:19,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {6108#(<= 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; {6108#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:19,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {6108#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6109#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:19,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {6109#(<= 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; {6109#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:19,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {6109#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6110#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:19,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {6110#(<= 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; {6110#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:19,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {6110#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6111#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:19,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {6111#(<= 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; {6111#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:19,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {6111#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6112#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:19,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {6112#(<= 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; {6112#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:19,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {6112#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6113#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:19,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {6113#(<= 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; {6113#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:19,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {6113#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6114#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:19,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {6114#(<= 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; {6114#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:19,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {6114#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6115#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {6115#(<= main_~a~0 10)} assume !(~a~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {6104#false} havoc ~i~0;~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 37: Hoare triple {6104#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 45: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,467 INFO L273 TraceCheckUtils]: 49: Hoare triple {6104#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 53: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 55: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {6104#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 63: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 67: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 69: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 70: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 71: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 73: Hoare triple {6104#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,470 INFO L273 TraceCheckUtils]: 75: Hoare triple {6104#false} ~i~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 78: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 79: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 80: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 81: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 82: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {6104#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; {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 85: Hoare triple {6104#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 86: Hoare triple {6104#false} assume !(~i~0 < 100000); {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 87: Hoare triple {6104#false} havoc ~x~0;~x~0 := 0; {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 88: Hoare triple {6104#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L256 TraceCheckUtils]: 89: Hoare triple {6104#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {6104#false} ~cond := #in~cond; {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {6104#false} assume 0 == ~cond; {6104#false} is VALID [2018-11-23 11:59:19,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {6104#false} assume !false; {6104#false} is VALID [2018-11-23 11:59:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-23 11:59:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:59:19,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-11-23 11:59:19,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:19,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:59:19,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:19,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:59:19,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:59:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:19,545 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 14 states. [2018-11-23 11:59:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:19,769 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-11-23 11:59:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:59:19,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-11-23 11:59:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2018-11-23 11:59:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:59:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2018-11-23 11:59:19,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 94 transitions. [2018-11-23 11:59:20,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,319 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:59:20,319 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:59:20,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:59:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 11:59:20,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:20,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 11:59:20,482 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 11:59:20,482 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 11:59:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,486 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-23 11:59:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-11-23 11:59:20,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,487 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 11:59:20,487 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 11:59:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:20,489 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-23 11:59:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-11-23 11:59:20,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:20,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:20,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:20,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:59:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-11-23 11:59:20,491 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 93 [2018-11-23 11:59:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:20,491 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-11-23 11:59:20,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:59:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 11:59:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:59:20,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:20,493 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 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] [2018-11-23 11:59:20,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:20,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1577927186, now seen corresponding path program 11 times [2018-11-23 11:59:20,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:20,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:21,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {7000#true} call ULTIMATE.init(); {7000#true} is VALID [2018-11-23 11:59:21,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {7000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7000#true} is VALID [2018-11-23 11:59:21,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {7000#true} assume true; {7000#true} is VALID [2018-11-23 11:59:21,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7000#true} {7000#true} #119#return; {7000#true} is VALID [2018-11-23 11:59:21,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {7000#true} call #t~ret15 := main(); {7000#true} is VALID [2018-11-23 11:59:21,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {7000#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);havoc ~a~0;~a~0 := 0; {7002#(= main_~a~0 0)} is VALID [2018-11-23 11:59:21,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {7002#(= 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; {7002#(= main_~a~0 0)} is VALID [2018-11-23 11:59:21,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {7002#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7003#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:21,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {7003#(<= 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; {7003#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:21,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {7003#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7004#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:21,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {7004#(<= 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; {7004#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:21,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {7004#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7005#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:21,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {7005#(<= 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; {7005#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:21,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {7005#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7006#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:21,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {7006#(<= 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; {7006#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:21,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {7006#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7007#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:21,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {7007#(<= 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; {7007#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:21,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {7007#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7008#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:21,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {7008#(<= 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; {7008#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:21,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {7008#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7009#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:21,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {7009#(<= 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; {7009#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:21,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {7009#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7010#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:21,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {7010#(<= 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; {7010#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:21,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {7010#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7011#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:21,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {7011#(<= 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; {7011#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:21,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {7011#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7012#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:21,364 INFO L273 TraceCheckUtils]: 26: Hoare triple {7012#(<= 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; {7012#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:21,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {7012#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7013#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:21,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {7013#(<= main_~a~0 11)} assume !(~a~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {7001#false} havoc ~i~0;~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {7001#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7001#false} is VALID [2018-11-23 11:59:21,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {7001#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7001#false} is VALID [2018-11-23 11:59:21,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {7001#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7001#false} is VALID [2018-11-23 11:59:21,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {7001#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7001#false} is VALID [2018-11-23 11:59:21,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {7001#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7001#false} is VALID [2018-11-23 11:59:21,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {7001#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#false} is VALID [2018-11-23 11:59:21,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {7001#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#false} is VALID [2018-11-23 11:59:21,369 INFO L273 TraceCheckUtils]: 46: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 47: Hoare triple {7001#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 49: Hoare triple {7001#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {7001#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:21,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:21,371 INFO L273 TraceCheckUtils]: 58: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 60: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 61: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 62: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 63: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:21,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 67: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 68: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 69: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:21,373 INFO L273 TraceCheckUtils]: 70: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 72: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 73: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 74: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 75: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:21,374 INFO L273 TraceCheckUtils]: 76: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 77: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 78: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 79: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 80: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 81: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 82: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 84: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 85: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 86: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 87: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 88: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:21,376 INFO L273 TraceCheckUtils]: 89: Hoare triple {7001#false} havoc ~x~0;~x~0 := 0; {7001#false} is VALID [2018-11-23 11:59:21,377 INFO L273 TraceCheckUtils]: 90: Hoare triple {7001#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7001#false} is VALID [2018-11-23 11:59:21,377 INFO L256 TraceCheckUtils]: 91: Hoare triple {7001#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {7001#false} is VALID [2018-11-23 11:59:21,377 INFO L273 TraceCheckUtils]: 92: Hoare triple {7001#false} ~cond := #in~cond; {7001#false} is VALID [2018-11-23 11:59:21,377 INFO L273 TraceCheckUtils]: 93: Hoare triple {7001#false} assume 0 == ~cond; {7001#false} is VALID [2018-11-23 11:59:21,377 INFO L273 TraceCheckUtils]: 94: Hoare triple {7001#false} assume !false; {7001#false} is VALID [2018-11-23 11:59:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-23 11:59:21,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:21,382 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 11:59:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:53,195 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:59:53,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:53,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:53,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {7000#true} call ULTIMATE.init(); {7000#true} is VALID [2018-11-23 11:59:53,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {7000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7000#true} is VALID [2018-11-23 11:59:53,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {7000#true} assume true; {7000#true} is VALID [2018-11-23 11:59:53,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7000#true} {7000#true} #119#return; {7000#true} is VALID [2018-11-23 11:59:53,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {7000#true} call #t~ret15 := main(); {7000#true} is VALID [2018-11-23 11:59:53,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {7000#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);havoc ~a~0;~a~0 := 0; {7000#true} is VALID [2018-11-23 11:59:53,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,456 INFO L273 TraceCheckUtils]: 18: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 25: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {7000#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {7000#true} assume !(~a~0 < 100000); {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {7000#true} havoc ~i~0;~i~0 := 0; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {7000#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 33: Hoare triple {7000#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7000#true} is VALID [2018-11-23 11:59:53,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 35: Hoare triple {7000#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {7000#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 38: Hoare triple {7000#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; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {7000#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {7000#true} assume !(~i~0 < 100000); {7000#true} is VALID [2018-11-23 11:59:53,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {7000#true} ~i~0 := 0; {7140#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:53,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {7140#(<= 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; {7140#(<= main_~i~0 0)} is VALID [2018-11-23 11:59:53,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {7140#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7147#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:53,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {7147#(<= 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; {7147#(<= main_~i~0 1)} is VALID [2018-11-23 11:59:53,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {7147#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7154#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:53,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {7154#(<= 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; {7154#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:53,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {7154#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7161#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:53,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {7161#(<= 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; {7161#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:53,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {7161#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7168#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:53,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {7168#(<= 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; {7168#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:53,463 INFO L273 TraceCheckUtils]: 51: Hoare triple {7168#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7175#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:53,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {7175#(<= main_~i~0 5)} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:53,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:53,464 INFO L273 TraceCheckUtils]: 54: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:53,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,465 INFO L273 TraceCheckUtils]: 57: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:53,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,465 INFO L273 TraceCheckUtils]: 59: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 63: Hoare triple {7001#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 64: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:53,466 INFO L273 TraceCheckUtils]: 65: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:53,467 INFO L273 TraceCheckUtils]: 66: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,467 INFO L273 TraceCheckUtils]: 67: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:53,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:53,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:53,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,468 INFO L273 TraceCheckUtils]: 73: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:53,468 INFO L273 TraceCheckUtils]: 74: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,468 INFO L273 TraceCheckUtils]: 75: Hoare triple {7001#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 77: Hoare triple {7001#false} ~i~0 := 0; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 78: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 79: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 81: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 82: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 83: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:53,469 INFO L273 TraceCheckUtils]: 84: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 85: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 86: Hoare triple {7001#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; {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {7001#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {7001#false} assume !(~i~0 < 100000); {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 89: Hoare triple {7001#false} havoc ~x~0;~x~0 := 0; {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 90: Hoare triple {7001#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L256 TraceCheckUtils]: 91: Hoare triple {7001#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {7001#false} is VALID [2018-11-23 11:59:53,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {7001#false} ~cond := #in~cond; {7001#false} is VALID [2018-11-23 11:59:53,471 INFO L273 TraceCheckUtils]: 93: Hoare triple {7001#false} assume 0 == ~cond; {7001#false} is VALID [2018-11-23 11:59:53,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {7001#false} assume !false; {7001#false} is VALID [2018-11-23 11:59:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-23 11:59:53,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:53,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 11:59:53,502 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2018-11-23 11:59:53,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:53,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:59:53,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:53,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:59:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:59:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:53,568 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 20 states. [2018-11-23 11:59:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,436 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2018-11-23 11:59:54,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:54,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2018-11-23 11:59:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 161 transitions. [2018-11-23 11:59:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:59:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 161 transitions. [2018-11-23 11:59:54,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 161 transitions. [2018-11-23 11:59:54,639 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:54,641 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:59:54,642 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 11:59:54,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 11:59:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-11-23 11:59:54,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:54,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 112 states. [2018-11-23 11:59:54,899 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 112 states. [2018-11-23 11:59:54,899 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 112 states. [2018-11-23 11:59:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,902 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 11:59:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:59:54,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:54,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:54,903 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 118 states. [2018-11-23 11:59:54,903 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 118 states. [2018-11-23 11:59:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,905 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 11:59:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:59:54,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:54,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:54,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:54,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:59:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 11:59:54,908 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 95 [2018-11-23 11:59:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:54,908 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 11:59:54,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:59:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 11:59:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:59:54,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:54,910 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:54,910 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:54,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -106186142, now seen corresponding path program 12 times [2018-11-23 11:59:54,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:55,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {7984#true} call ULTIMATE.init(); {7984#true} is VALID [2018-11-23 11:59:55,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {7984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7984#true} is VALID [2018-11-23 11:59:55,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {7984#true} assume true; {7984#true} is VALID [2018-11-23 11:59:55,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7984#true} {7984#true} #119#return; {7984#true} is VALID [2018-11-23 11:59:55,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {7984#true} call #t~ret15 := main(); {7984#true} is VALID [2018-11-23 11:59:55,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {7984#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);havoc ~a~0;~a~0 := 0; {7986#(= main_~a~0 0)} is VALID [2018-11-23 11:59:55,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {7986#(= 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; {7986#(= main_~a~0 0)} is VALID [2018-11-23 11:59:55,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {7986#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7987#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:55,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {7987#(<= 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; {7987#(<= main_~a~0 1)} is VALID [2018-11-23 11:59:55,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {7987#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7988#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:55,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {7988#(<= 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; {7988#(<= main_~a~0 2)} is VALID [2018-11-23 11:59:55,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {7988#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7989#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:55,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {7989#(<= 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; {7989#(<= main_~a~0 3)} is VALID [2018-11-23 11:59:55,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {7989#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7990#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:55,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {7990#(<= 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; {7990#(<= main_~a~0 4)} is VALID [2018-11-23 11:59:55,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {7990#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7991#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:55,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {7991#(<= 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; {7991#(<= main_~a~0 5)} is VALID [2018-11-23 11:59:55,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {7991#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7992#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:55,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {7992#(<= 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; {7992#(<= main_~a~0 6)} is VALID [2018-11-23 11:59:55,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {7992#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7993#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:55,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {7993#(<= 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; {7993#(<= main_~a~0 7)} is VALID [2018-11-23 11:59:55,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {7993#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7994#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:55,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {7994#(<= 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; {7994#(<= main_~a~0 8)} is VALID [2018-11-23 11:59:55,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {7994#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7995#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:55,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {7995#(<= 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; {7995#(<= main_~a~0 9)} is VALID [2018-11-23 11:59:55,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {7995#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7996#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:55,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {7996#(<= 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; {7996#(<= main_~a~0 10)} is VALID [2018-11-23 11:59:55,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {7996#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7997#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:55,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {7997#(<= 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; {7997#(<= main_~a~0 11)} is VALID [2018-11-23 11:59:55,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {7997#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7998#(<= main_~a~0 12)} is VALID [2018-11-23 11:59:55,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {7998#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#false} havoc ~i~0;~i~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7985#false} is VALID [2018-11-23 11:59:55,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,238 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,238 INFO L273 TraceCheckUtils]: 54: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,239 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,241 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,242 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,243 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,243 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,243 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 11:59:55,243 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,243 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,244 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 96: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 97: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 98: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 99: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 100: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 11:59:55,245 INFO L273 TraceCheckUtils]: 101: Hoare triple {7985#false} havoc ~x~0;~x~0 := 0; {7985#false} is VALID [2018-11-23 11:59:55,246 INFO L273 TraceCheckUtils]: 102: Hoare triple {7985#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7985#false} is VALID [2018-11-23 11:59:55,246 INFO L256 TraceCheckUtils]: 103: Hoare triple {7985#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {7985#false} is VALID [2018-11-23 11:59:55,246 INFO L273 TraceCheckUtils]: 104: Hoare triple {7985#false} ~cond := #in~cond; {7985#false} is VALID [2018-11-23 11:59:55,246 INFO L273 TraceCheckUtils]: 105: Hoare triple {7985#false} assume 0 == ~cond; {7985#false} is VALID [2018-11-23 11:59:55,246 INFO L273 TraceCheckUtils]: 106: Hoare triple {7985#false} assume !false; {7985#false} is VALID [2018-11-23 11:59:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:59:55,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:55,259 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 11:59:55,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:09,638 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:00:09,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:09,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:09,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {7984#true} call ULTIMATE.init(); {7984#true} is VALID [2018-11-23 12:00:09,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {7984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7984#true} is VALID [2018-11-23 12:00:09,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {7984#true} assume true; {7984#true} is VALID [2018-11-23 12:00:09,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7984#true} {7984#true} #119#return; {7984#true} is VALID [2018-11-23 12:00:09,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {7984#true} call #t~ret15 := main(); {7984#true} is VALID [2018-11-23 12:00:09,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {7984#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);havoc ~a~0;~a~0 := 0; {7984#true} is VALID [2018-11-23 12:00:09,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 29: Hoare triple {7984#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {7984#true} assume !(~a~0 < 100000); {7984#true} is VALID [2018-11-23 12:00:09,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {7984#true} havoc ~i~0;~i~0 := 0; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 35: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {7984#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {7984#true} assume !(~i~0 < 100000); {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {7984#true} ~i~0 := 0; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {7984#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#true} is VALID [2018-11-23 12:00:09,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {7984#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {7984#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {7984#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 54: Hoare triple {7984#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; {7984#true} is VALID [2018-11-23 12:00:09,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {7984#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7984#true} is VALID [2018-11-23 12:00:09,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {7984#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; {8170#(< main_~i~0 100000)} is VALID [2018-11-23 12:00:09,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {8170#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8174#(<= main_~i~0 100000)} is VALID [2018-11-23 12:00:09,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {8174#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7984#true} is VALID [2018-11-23 12:00:10,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {7984#true} ~i~0 := 0; {8181#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:10,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {8181#(<= 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; {8181#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:10,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {8181#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8188#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:10,001 INFO L273 TraceCheckUtils]: 62: Hoare triple {8188#(<= 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; {8188#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:10,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {8188#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8195#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:10,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {8195#(<= 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; {8195#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:10,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {8195#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8202#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:10,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {8202#(<= 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; {8202#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:10,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {8202#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:10,004 INFO L273 TraceCheckUtils]: 68: Hoare triple {8209#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8209#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:10,004 INFO L273 TraceCheckUtils]: 69: Hoare triple {8209#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8216#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:10,005 INFO L273 TraceCheckUtils]: 70: Hoare triple {8216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {8216#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:10,006 INFO L273 TraceCheckUtils]: 71: Hoare triple {8216#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8223#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:10,006 INFO L273 TraceCheckUtils]: 72: Hoare triple {8223#(<= main_~i~0 6)} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 12:00:10,006 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 12:00:10,007 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,007 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,007 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,007 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,007 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 81: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,008 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,009 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {7985#false} is VALID [2018-11-23 12:00:10,009 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 12:00:10,009 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#false} ~i~0 := 0; {7985#false} is VALID [2018-11-23 12:00:10,009 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,009 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 96: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,010 INFO L273 TraceCheckUtils]: 97: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 98: Hoare triple {7985#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; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 99: Hoare triple {7985#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 100: Hoare triple {7985#false} assume !(~i~0 < 100000); {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 101: Hoare triple {7985#false} havoc ~x~0;~x~0 := 0; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 102: Hoare triple {7985#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L256 TraceCheckUtils]: 103: Hoare triple {7985#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 104: Hoare triple {7985#false} ~cond := #in~cond; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 105: Hoare triple {7985#false} assume 0 == ~cond; {7985#false} is VALID [2018-11-23 12:00:10,011 INFO L273 TraceCheckUtils]: 106: Hoare triple {7985#false} assume !false; {7985#false} is VALID [2018-11-23 12:00:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-11-23 12:00:10,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:10,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-23 12:00:10,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-11-23 12:00:10,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:10,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:00:10,116 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 12:00:10,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:00:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:00:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:00:10,117 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 24 states. [2018-11-23 12:00:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,693 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2018-11-23 12:00:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:00:11,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-11-23 12:00:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:00:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2018-11-23 12:00:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:00:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2018-11-23 12:00:11,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 183 transitions. [2018-11-23 12:00:11,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:11,916 INFO L225 Difference]: With dead ends: 216 [2018-11-23 12:00:11,916 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:00:11,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:00:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:00:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-23 12:00:11,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:11,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-23 12:00:11,971 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-23 12:00:11,971 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-23 12:00:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,977 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-11-23 12:00:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-11-23 12:00:11,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,977 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-23 12:00:11,978 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-23 12:00:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,982 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-11-23 12:00:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-11-23 12:00:11,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:11,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 12:00:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-11-23 12:00:11,987 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 107 [2018-11-23 12:00:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:11,987 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-11-23 12:00:11,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:00:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-11-23 12:00:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 12:00:11,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:11,989 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 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] [2018-11-23 12:00:11,989 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:11,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -198781780, now seen corresponding path program 13 times [2018-11-23 12:00:11,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:11,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:12,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9118#true} is VALID [2018-11-23 12:00:12,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {9118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9118#true} is VALID [2018-11-23 12:00:12,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2018-11-23 12:00:12,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #119#return; {9118#true} is VALID [2018-11-23 12:00:12,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret15 := main(); {9118#true} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {9118#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);havoc ~a~0;~a~0 := 0; {9120#(= main_~a~0 0)} is VALID [2018-11-23 12:00:12,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {9120#(= 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; {9120#(= main_~a~0 0)} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {9120#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9121#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {9121#(<= 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; {9121#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {9121#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9122#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {9122#(<= 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; {9122#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {9122#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9123#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {9123#(<= 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; {9123#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {9123#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9124#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {9124#(<= 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; {9124#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {9124#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9125#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {9125#(<= 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; {9125#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {9125#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9126#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {9126#(<= 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; {9126#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {9126#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9127#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {9127#(<= 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; {9127#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {9127#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9128#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {9128#(<= 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; {9128#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {9128#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9129#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {9129#(<= 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; {9129#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {9129#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9130#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {9130#(<= 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; {9130#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {9130#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9131#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:12,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {9131#(<= 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; {9131#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:12,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {9131#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9132#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {9132#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9132#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:12,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {9132#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9133#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:12,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {9133#(<= main_~a~0 13)} assume !(~a~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {9119#false} havoc ~i~0;~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 42: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,293 INFO L273 TraceCheckUtils]: 48: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,293 INFO L273 TraceCheckUtils]: 49: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,293 INFO L273 TraceCheckUtils]: 50: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 52: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 53: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 54: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 55: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 56: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,294 INFO L273 TraceCheckUtils]: 57: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 58: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 59: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 60: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 63: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 71: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 72: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 73: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 74: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 76: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 79: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 80: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 81: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 82: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 83: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,297 INFO L273 TraceCheckUtils]: 84: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 85: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 86: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 87: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 88: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 89: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 90: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 91: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,298 INFO L273 TraceCheckUtils]: 92: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 93: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 95: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 96: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 97: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 98: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 99: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 100: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,299 INFO L273 TraceCheckUtils]: 101: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 102: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 103: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 104: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 105: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 106: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 107: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 108: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 109: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,300 INFO L273 TraceCheckUtils]: 110: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 111: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 112: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 113: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 114: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 115: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 116: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 117: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 118: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,301 INFO L273 TraceCheckUtils]: 119: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 120: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 121: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 122: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 123: Hoare triple {9119#false} havoc ~x~0;~x~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 124: Hoare triple {9119#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L256 TraceCheckUtils]: 125: Hoare triple {9119#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 126: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 127: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2018-11-23 12:00:12,302 INFO L273 TraceCheckUtils]: 128: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2018-11-23 12:00:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:00:12,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:12,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:12,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:12,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9118#true} is VALID [2018-11-23 12:00:12,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {9118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9118#true} is VALID [2018-11-23 12:00:12,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2018-11-23 12:00:12,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #119#return; {9118#true} is VALID [2018-11-23 12:00:12,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret15 := main(); {9118#true} is VALID [2018-11-23 12:00:12,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {9118#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);havoc ~a~0;~a~0 := 0; {9152#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:12,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {9152#(<= 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; {9152#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:12,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {9152#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9121#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {9121#(<= 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; {9121#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:12,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {9121#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9122#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {9122#(<= 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; {9122#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:12,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {9122#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9123#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {9123#(<= 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; {9123#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:12,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {9123#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9124#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {9124#(<= 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; {9124#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:12,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {9124#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9125#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {9125#(<= 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; {9125#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:12,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {9125#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9126#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {9126#(<= 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; {9126#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:12,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {9126#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9127#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {9127#(<= 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; {9127#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:12,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {9127#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9128#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {9128#(<= 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; {9128#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:12,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {9128#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9129#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {9129#(<= 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; {9129#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:12,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {9129#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9130#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {9130#(<= 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; {9130#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:12,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {9130#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9131#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:12,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {9131#(<= 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; {9131#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:12,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {9131#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9132#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:12,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {9132#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {9132#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:12,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {9132#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9133#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:12,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {9133#(<= main_~a~0 13)} assume !(~a~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {9119#false} havoc ~i~0;~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 38: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {9119#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 53: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 54: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 56: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 57: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 60: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 61: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 62: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 63: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,671 INFO L273 TraceCheckUtils]: 64: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 65: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 67: Hoare triple {9119#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 68: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 69: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 70: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 71: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 75: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 76: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 77: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 78: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 79: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 80: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,673 INFO L273 TraceCheckUtils]: 81: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 82: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 83: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {9119#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 87: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 88: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 89: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,674 INFO L273 TraceCheckUtils]: 90: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 91: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 92: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 93: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 94: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 95: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 96: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 97: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 98: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,675 INFO L273 TraceCheckUtils]: 99: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 102: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 103: Hoare triple {9119#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 104: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 105: Hoare triple {9119#false} ~i~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 106: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 107: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,676 INFO L273 TraceCheckUtils]: 108: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 109: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 110: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 111: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 112: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 113: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 114: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 115: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 116: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,677 INFO L273 TraceCheckUtils]: 117: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 118: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 119: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 120: Hoare triple {9119#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; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 121: Hoare triple {9119#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 122: Hoare triple {9119#false} assume !(~i~0 < 100000); {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 123: Hoare triple {9119#false} havoc ~x~0;~x~0 := 0; {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 124: Hoare triple {9119#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L256 TraceCheckUtils]: 125: Hoare triple {9119#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {9119#false} is VALID [2018-11-23 12:00:12,678 INFO L273 TraceCheckUtils]: 126: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2018-11-23 12:00:12,679 INFO L273 TraceCheckUtils]: 127: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2018-11-23 12:00:12,679 INFO L273 TraceCheckUtils]: 128: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2018-11-23 12:00:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:00:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:12,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:00:12,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2018-11-23 12:00:12,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:12,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:00:12,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:12,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:00:12,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:00:12,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:12,762 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 17 states. [2018-11-23 12:00:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:13,976 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2018-11-23 12:00:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:00:13,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2018-11-23 12:00:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2018-11-23 12:00:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:00:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 100 transitions. [2018-11-23 12:00:13,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 100 transitions. [2018-11-23 12:00:14,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:14,068 INFO L225 Difference]: With dead ends: 238 [2018-11-23 12:00:14,068 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:00:14,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:00:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-11-23 12:00:14,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:14,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 136 states. [2018-11-23 12:00:14,122 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 136 states. [2018-11-23 12:00:14,122 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 136 states. [2018-11-23 12:00:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:14,128 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-11-23 12:00:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-11-23 12:00:14,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:14,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:14,129 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 137 states. [2018-11-23 12:00:14,129 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 137 states. [2018-11-23 12:00:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:14,134 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-11-23 12:00:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-11-23 12:00:14,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:14,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:14,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:14,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:00:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-11-23 12:00:14,140 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 129 [2018-11-23 12:00:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:14,140 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-11-23 12:00:14,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:00:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-11-23 12:00:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 12:00:14,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:14,142 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 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] [2018-11-23 12:00:14,142 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:14,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1385953610, now seen corresponding path program 14 times [2018-11-23 12:00:14,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:14,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:14,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {10351#true} call ULTIMATE.init(); {10351#true} is VALID [2018-11-23 12:00:14,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {10351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10351#true} is VALID [2018-11-23 12:00:14,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {10351#true} assume true; {10351#true} is VALID [2018-11-23 12:00:14,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10351#true} {10351#true} #119#return; {10351#true} is VALID [2018-11-23 12:00:14,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {10351#true} call #t~ret15 := main(); {10351#true} is VALID [2018-11-23 12:00:14,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {10351#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);havoc ~a~0;~a~0 := 0; {10353#(= main_~a~0 0)} is VALID [2018-11-23 12:00:14,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {10353#(= 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; {10353#(= main_~a~0 0)} is VALID [2018-11-23 12:00:14,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {10353#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10354#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:14,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {10354#(<= 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; {10354#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:14,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {10354#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10355#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:14,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {10355#(<= 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; {10355#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:14,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {10355#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10356#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:14,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {10356#(<= 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; {10356#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:14,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {10356#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10357#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:14,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {10357#(<= 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; {10357#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:14,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {10357#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10358#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:14,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {10358#(<= 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; {10358#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:14,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {10358#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10359#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:14,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {10359#(<= 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; {10359#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:14,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {10359#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10360#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:14,777 INFO L273 TraceCheckUtils]: 20: Hoare triple {10360#(<= 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; {10360#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:14,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {10360#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10361#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:14,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {10361#(<= 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; {10361#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:14,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {10361#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10362#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:14,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {10362#(<= 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; {10362#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:14,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {10362#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10363#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:14,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {10363#(<= 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; {10363#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:14,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {10363#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10364#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:14,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {10364#(<= 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; {10364#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:14,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {10364#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10365#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:14,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {10365#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10365#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:14,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {10365#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10366#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:14,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {10366#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10366#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:14,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10367#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:14,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {10367#(<= main_~a~0 14)} assume !(~a~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {10352#false} havoc ~i~0;~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,787 INFO L273 TraceCheckUtils]: 41: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,788 INFO L273 TraceCheckUtils]: 47: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,788 INFO L273 TraceCheckUtils]: 48: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 49: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 52: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 53: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 54: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 55: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 57: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 58: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 59: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 60: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 61: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 62: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 63: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 64: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,790 INFO L273 TraceCheckUtils]: 65: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 66: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 67: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 71: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 72: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 73: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 74: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 76: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 77: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 78: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 79: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 80: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 81: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 82: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,792 INFO L273 TraceCheckUtils]: 83: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 84: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 85: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 86: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 87: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 88: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 89: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 90: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 91: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 92: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 93: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 94: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 95: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 96: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 97: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 98: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 99: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,794 INFO L273 TraceCheckUtils]: 100: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 101: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 102: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 103: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 104: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 105: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 106: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 107: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 110: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 111: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 112: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 113: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 114: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 115: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 116: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 117: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,796 INFO L273 TraceCheckUtils]: 118: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 119: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 120: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 121: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 122: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 123: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 124: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 125: Hoare triple {10352#false} havoc ~x~0;~x~0 := 0; {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 126: Hoare triple {10352#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10352#false} is VALID [2018-11-23 12:00:14,797 INFO L256 TraceCheckUtils]: 127: Hoare triple {10352#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {10352#false} is VALID [2018-11-23 12:00:14,798 INFO L273 TraceCheckUtils]: 128: Hoare triple {10352#false} ~cond := #in~cond; {10352#false} is VALID [2018-11-23 12:00:14,798 INFO L273 TraceCheckUtils]: 129: Hoare triple {10352#false} assume 0 == ~cond; {10352#false} is VALID [2018-11-23 12:00:14,798 INFO L273 TraceCheckUtils]: 130: Hoare triple {10352#false} assume !false; {10352#false} is VALID [2018-11-23 12:00:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:00:14,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:14,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:14,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:14,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:14,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:15,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {10351#true} call ULTIMATE.init(); {10351#true} is VALID [2018-11-23 12:00:15,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {10351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10351#true} is VALID [2018-11-23 12:00:15,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {10351#true} assume true; {10351#true} is VALID [2018-11-23 12:00:15,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10351#true} {10351#true} #119#return; {10351#true} is VALID [2018-11-23 12:00:15,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {10351#true} call #t~ret15 := main(); {10351#true} is VALID [2018-11-23 12:00:15,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {10351#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);havoc ~a~0;~a~0 := 0; {10386#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:15,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {10386#(<= 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; {10386#(<= main_~a~0 0)} is VALID [2018-11-23 12:00:15,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {10386#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10354#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:15,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {10354#(<= 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; {10354#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:15,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {10354#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10355#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:15,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {10355#(<= 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; {10355#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:15,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {10355#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10356#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:15,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {10356#(<= 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; {10356#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:15,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {10356#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10357#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:15,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {10357#(<= 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; {10357#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:15,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {10357#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10358#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:15,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {10358#(<= 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; {10358#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:15,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {10358#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10359#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:15,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {10359#(<= 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; {10359#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:15,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {10359#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10360#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:15,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {10360#(<= 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; {10360#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:15,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {10360#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10361#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:15,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {10361#(<= 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; {10361#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:15,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {10361#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10362#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:15,132 INFO L273 TraceCheckUtils]: 24: Hoare triple {10362#(<= 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; {10362#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:15,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {10362#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10363#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:15,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {10363#(<= 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; {10363#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:15,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {10363#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10364#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:15,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {10364#(<= 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; {10364#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:15,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {10364#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10365#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:15,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {10365#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10365#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:15,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {10365#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10366#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:15,137 INFO L273 TraceCheckUtils]: 32: Hoare triple {10366#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {10366#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:15,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10367#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:15,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {10367#(<= main_~a~0 14)} assume !(~a~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {10352#false} havoc ~i~0;~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,139 INFO L273 TraceCheckUtils]: 36: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,139 INFO L273 TraceCheckUtils]: 37: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {10352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 54: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 62: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 63: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,142 INFO L273 TraceCheckUtils]: 64: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 65: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 66: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 67: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 69: Hoare triple {10352#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 70: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 71: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 72: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,143 INFO L273 TraceCheckUtils]: 73: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 74: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 75: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 76: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 77: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 78: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 79: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 80: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 81: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,144 INFO L273 TraceCheckUtils]: 82: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 83: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 84: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 85: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 86: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 87: Hoare triple {10352#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 88: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 89: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 90: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,145 INFO L273 TraceCheckUtils]: 91: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 92: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 93: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 94: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 95: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 96: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 97: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 98: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 99: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,146 INFO L273 TraceCheckUtils]: 100: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 101: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 102: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 103: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 104: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 105: Hoare triple {10352#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 106: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 107: Hoare triple {10352#false} ~i~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,147 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 110: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 111: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 112: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 113: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 114: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 115: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 116: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,148 INFO L273 TraceCheckUtils]: 117: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 118: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 119: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 120: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 121: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 122: Hoare triple {10352#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; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 123: Hoare triple {10352#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 124: Hoare triple {10352#false} assume !(~i~0 < 100000); {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 125: Hoare triple {10352#false} havoc ~x~0;~x~0 := 0; {10352#false} is VALID [2018-11-23 12:00:15,149 INFO L273 TraceCheckUtils]: 126: Hoare triple {10352#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {10352#false} is VALID [2018-11-23 12:00:15,150 INFO L256 TraceCheckUtils]: 127: Hoare triple {10352#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {10352#false} is VALID [2018-11-23 12:00:15,150 INFO L273 TraceCheckUtils]: 128: Hoare triple {10352#false} ~cond := #in~cond; {10352#false} is VALID [2018-11-23 12:00:15,150 INFO L273 TraceCheckUtils]: 129: Hoare triple {10352#false} assume 0 == ~cond; {10352#false} is VALID [2018-11-23 12:00:15,150 INFO L273 TraceCheckUtils]: 130: Hoare triple {10352#false} assume !false; {10352#false} is VALID [2018-11-23 12:00:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:00:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:15,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:00:15,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-11-23 12:00:15,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:15,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:00:15,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:15,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:00:15,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:00:15,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:15,239 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 18 states. [2018-11-23 12:00:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:15,798 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions. [2018-11-23 12:00:15,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:00:15,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-11-23 12:00:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-23 12:00:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:00:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-23 12:00:15,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-23 12:00:15,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:15,889 INFO L225 Difference]: With dead ends: 240 [2018-11-23 12:00:15,889 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:00:15,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:00:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:00:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-23 12:00:15,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:15,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 138 states. [2018-11-23 12:00:15,967 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 138 states. [2018-11-23 12:00:15,967 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 138 states. [2018-11-23 12:00:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:15,969 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-23 12:00:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-23 12:00:15,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:15,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:15,970 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 139 states. [2018-11-23 12:00:15,970 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 139 states. [2018-11-23 12:00:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:15,972 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-11-23 12:00:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-11-23 12:00:15,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:15,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:15,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:15,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 12:00:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-11-23 12:00:15,975 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 131 [2018-11-23 12:00:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:15,976 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-11-23 12:00:15,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:00:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-11-23 12:00:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:00:15,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:15,977 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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] [2018-11-23 12:00:15,978 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:15,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -396726680, now seen corresponding path program 15 times [2018-11-23 12:00:15,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:15,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:15,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:16,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {11601#true} call ULTIMATE.init(); {11601#true} is VALID [2018-11-23 12:00:16,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {11601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11601#true} is VALID [2018-11-23 12:00:16,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {11601#true} assume true; {11601#true} is VALID [2018-11-23 12:00:16,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11601#true} {11601#true} #119#return; {11601#true} is VALID [2018-11-23 12:00:16,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {11601#true} call #t~ret15 := main(); {11601#true} is VALID [2018-11-23 12:00:16,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {11601#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);havoc ~a~0;~a~0 := 0; {11603#(= main_~a~0 0)} is VALID [2018-11-23 12:00:16,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {11603#(= 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; {11603#(= main_~a~0 0)} is VALID [2018-11-23 12:00:16,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {11603#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11604#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:16,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {11604#(<= 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; {11604#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:16,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {11604#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11605#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:16,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {11605#(<= 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; {11605#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:16,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {11605#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11606#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:16,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {11606#(<= 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; {11606#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:16,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {11606#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11607#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:16,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {11607#(<= 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; {11607#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:16,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {11607#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11608#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:16,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {11608#(<= 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; {11608#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:16,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {11608#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11609#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:16,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {11609#(<= 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; {11609#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:16,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {11609#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11610#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:16,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {11610#(<= 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; {11610#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:16,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {11610#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11611#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:16,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {11611#(<= 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; {11611#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:16,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {11611#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11612#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:16,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {11612#(<= 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; {11612#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:16,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {11612#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11613#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:16,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {11613#(<= 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; {11613#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:16,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {11613#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11614#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:16,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {11614#(<= 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; {11614#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:16,650 INFO L273 TraceCheckUtils]: 29: Hoare triple {11614#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11615#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:16,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {11615#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11615#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:16,652 INFO L273 TraceCheckUtils]: 31: Hoare triple {11615#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11616#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:16,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {11616#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11616#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:16,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {11616#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11617#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:16,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {11617#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {11617#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:16,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {11617#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11618#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {11618#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {11602#false} havoc ~i~0;~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 39: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,655 INFO L273 TraceCheckUtils]: 40: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 44: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 48: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 51: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 52: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 53: Hoare triple {11602#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 62: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 63: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 65: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 67: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 71: Hoare triple {11602#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11602#false} is VALID [2018-11-23 12:00:16,660 INFO L273 TraceCheckUtils]: 72: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 73: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 78: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 79: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 80: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,661 INFO L273 TraceCheckUtils]: 81: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 82: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 83: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 84: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 85: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 86: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 87: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 88: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 89: Hoare triple {11602#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11602#false} is VALID [2018-11-23 12:00:16,662 INFO L273 TraceCheckUtils]: 90: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 91: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 92: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 93: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 94: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 95: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,663 INFO L273 TraceCheckUtils]: 98: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 99: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 100: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 101: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 102: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 103: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 104: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 105: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 106: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,664 INFO L273 TraceCheckUtils]: 107: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 108: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 109: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 110: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 111: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 112: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 113: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 114: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 115: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,665 INFO L273 TraceCheckUtils]: 116: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 117: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 118: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 119: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 120: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 121: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 122: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 123: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 124: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:16,666 INFO L273 TraceCheckUtils]: 125: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 126: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 127: Hoare triple {11602#false} havoc ~x~0;~x~0 := 0; {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 128: Hoare triple {11602#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L256 TraceCheckUtils]: 129: Hoare triple {11602#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 130: Hoare triple {11602#false} ~cond := #in~cond; {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 131: Hoare triple {11602#false} assume 0 == ~cond; {11602#false} is VALID [2018-11-23 12:00:16,667 INFO L273 TraceCheckUtils]: 132: Hoare triple {11602#false} assume !false; {11602#false} is VALID [2018-11-23 12:00:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:00:16,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:16,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:29,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:00:29,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:29,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:30,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {11601#true} call ULTIMATE.init(); {11601#true} is VALID [2018-11-23 12:00:30,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {11601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11601#true} is VALID [2018-11-23 12:00:30,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {11601#true} assume true; {11601#true} is VALID [2018-11-23 12:00:30,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11601#true} {11601#true} #119#return; {11601#true} is VALID [2018-11-23 12:00:30,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {11601#true} call #t~ret15 := main(); {11601#true} is VALID [2018-11-23 12:00:30,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {11601#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);havoc ~a~0;~a~0 := 0; {11601#true} is VALID [2018-11-23 12:00:30,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {11601#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11601#true} is VALID [2018-11-23 12:00:30,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {11601#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; {11724#(< main_~a~0 100000)} is VALID [2018-11-23 12:00:30,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {11724#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11728#(<= main_~a~0 100000)} is VALID [2018-11-23 12:00:30,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {11728#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {11601#true} is VALID [2018-11-23 12:00:30,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {11601#true} havoc ~i~0;~i~0 := 0; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 39: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 44: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {11601#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11601#true} is VALID [2018-11-23 12:00:30,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {11601#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; {11780#(< main_~i~0 100000)} is VALID [2018-11-23 12:00:30,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {11780#(< main_~i~0 100000)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11784#(<= main_~i~0 100000)} is VALID [2018-11-23 12:00:30,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {11784#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {11601#true} ~i~0 := 0; {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 57: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 58: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 59: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,298 INFO L273 TraceCheckUtils]: 60: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 61: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 62: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 63: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 64: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 65: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 66: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 67: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 68: Hoare triple {11601#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; {11601#true} is VALID [2018-11-23 12:00:30,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {11601#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11601#true} is VALID [2018-11-23 12:00:30,300 INFO L273 TraceCheckUtils]: 70: Hoare triple {11601#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; {11780#(< main_~i~0 100000)} is VALID [2018-11-23 12:00:30,300 INFO L273 TraceCheckUtils]: 71: Hoare triple {11780#(< main_~i~0 100000)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11784#(<= main_~i~0 100000)} is VALID [2018-11-23 12:00:30,300 INFO L273 TraceCheckUtils]: 72: Hoare triple {11784#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11601#true} is VALID [2018-11-23 12:00:30,301 INFO L273 TraceCheckUtils]: 73: Hoare triple {11601#true} ~i~0 := 0; {11845#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:30,301 INFO L273 TraceCheckUtils]: 74: Hoare triple {11845#(<= 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; {11845#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:30,301 INFO L273 TraceCheckUtils]: 75: Hoare triple {11845#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11852#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:30,302 INFO L273 TraceCheckUtils]: 76: Hoare triple {11852#(<= 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; {11852#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:30,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {11852#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11859#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:30,302 INFO L273 TraceCheckUtils]: 78: Hoare triple {11859#(<= 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; {11859#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:30,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {11859#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11866#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:30,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {11866#(<= 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; {11866#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:30,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {11866#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11873#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:30,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {11873#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11873#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:30,305 INFO L273 TraceCheckUtils]: 83: Hoare triple {11873#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:30,306 INFO L273 TraceCheckUtils]: 84: Hoare triple {11880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:30,306 INFO L273 TraceCheckUtils]: 85: Hoare triple {11880#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11887#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:30,307 INFO L273 TraceCheckUtils]: 86: Hoare triple {11887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11887#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:30,307 INFO L273 TraceCheckUtils]: 87: Hoare triple {11887#(<= main_~i~0 6)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11894#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:30,308 INFO L273 TraceCheckUtils]: 88: Hoare triple {11894#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem7; {11894#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:30,309 INFO L273 TraceCheckUtils]: 89: Hoare triple {11894#(<= main_~i~0 7)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11901#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:30,309 INFO L273 TraceCheckUtils]: 90: Hoare triple {11901#(<= main_~i~0 8)} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:30,309 INFO L273 TraceCheckUtils]: 91: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:30,310 INFO L273 TraceCheckUtils]: 92: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,310 INFO L273 TraceCheckUtils]: 94: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,310 INFO L273 TraceCheckUtils]: 95: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,310 INFO L273 TraceCheckUtils]: 96: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,311 INFO L273 TraceCheckUtils]: 97: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,311 INFO L273 TraceCheckUtils]: 98: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,311 INFO L273 TraceCheckUtils]: 99: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,311 INFO L273 TraceCheckUtils]: 100: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,311 INFO L273 TraceCheckUtils]: 101: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 102: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 103: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 104: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 105: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 106: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,312 INFO L273 TraceCheckUtils]: 107: Hoare triple {11602#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 108: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 109: Hoare triple {11602#false} ~i~0 := 0; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 110: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 111: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 112: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 113: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,313 INFO L273 TraceCheckUtils]: 114: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 115: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 116: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 117: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 118: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 119: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 120: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 121: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,314 INFO L273 TraceCheckUtils]: 122: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 123: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 124: Hoare triple {11602#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; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 125: Hoare triple {11602#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 126: Hoare triple {11602#false} assume !(~i~0 < 100000); {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 127: Hoare triple {11602#false} havoc ~x~0;~x~0 := 0; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 128: Hoare triple {11602#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L256 TraceCheckUtils]: 129: Hoare triple {11602#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 130: Hoare triple {11602#false} ~cond := #in~cond; {11602#false} is VALID [2018-11-23 12:00:30,315 INFO L273 TraceCheckUtils]: 131: Hoare triple {11602#false} assume 0 == ~cond; {11602#false} is VALID [2018-11-23 12:00:30,316 INFO L273 TraceCheckUtils]: 132: Hoare triple {11602#false} assume !false; {11602#false} is VALID [2018-11-23 12:00:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 59 proven. 64 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-11-23 12:00:30,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:30,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-11-23 12:00:30,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 133 [2018-11-23 12:00:30,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:30,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:00:30,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:30,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:00:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:00:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:30,442 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 31 states. [2018-11-23 12:00:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,619 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-11-23 12:00:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:00:31,619 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 133 [2018-11-23 12:00:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 211 transitions. [2018-11-23 12:00:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 211 transitions. [2018-11-23 12:00:31,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 211 transitions. [2018-11-23 12:00:32,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:32,416 INFO L225 Difference]: With dead ends: 263 [2018-11-23 12:00:32,416 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:00:32,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1301, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:00:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:00:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-23 12:00:32,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:32,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 162 states. [2018-11-23 12:00:32,563 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 12:00:32,563 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 12:00:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:32,568 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-23 12:00:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-23 12:00:32,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:32,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:32,569 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 12:00:32,569 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 12:00:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:32,572 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-11-23 12:00:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-23 12:00:32,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:32,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:32,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:32,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 12:00:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2018-11-23 12:00:32,576 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 133 [2018-11-23 12:00:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:32,577 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2018-11-23 12:00:32,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:00:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-11-23 12:00:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 12:00:32,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:32,578 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 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] [2018-11-23 12:00:32,578 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:32,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1173111984, now seen corresponding path program 16 times [2018-11-23 12:00:32,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:32,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:33,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {13020#true} call ULTIMATE.init(); {13020#true} is VALID [2018-11-23 12:00:33,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {13020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13020#true} is VALID [2018-11-23 12:00:33,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {13020#true} assume true; {13020#true} is VALID [2018-11-23 12:00:33,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13020#true} {13020#true} #119#return; {13020#true} is VALID [2018-11-23 12:00:33,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {13020#true} call #t~ret15 := main(); {13020#true} is VALID [2018-11-23 12:00:33,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {13020#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);havoc ~a~0;~a~0 := 0; {13022#(= main_~a~0 0)} is VALID [2018-11-23 12:00:33,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {13022#(= 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; {13022#(= main_~a~0 0)} is VALID [2018-11-23 12:00:33,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {13022#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13023#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:33,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {13023#(<= 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; {13023#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:33,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {13023#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13024#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:33,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {13024#(<= 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; {13024#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:33,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {13024#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13025#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:33,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {13025#(<= 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; {13025#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:33,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {13025#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13026#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:33,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {13026#(<= 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; {13026#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:33,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {13026#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13027#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:33,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {13027#(<= 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; {13027#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:33,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {13027#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13028#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:33,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {13028#(<= 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; {13028#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:33,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {13028#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13029#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:33,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {13029#(<= 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; {13029#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:33,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {13029#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13030#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:33,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {13030#(<= 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; {13030#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:33,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {13030#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13031#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:33,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {13031#(<= 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; {13031#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:33,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {13031#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13032#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:33,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {13032#(<= 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; {13032#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:33,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {13032#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13033#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:33,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {13033#(<= 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; {13033#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:33,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {13033#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13034#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:33,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {13034#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13034#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:33,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {13034#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13035#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:33,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {13035#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13035#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:33,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {13035#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13036#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:33,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {13036#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13036#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:33,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {13036#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13037#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:33,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {13037#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13037#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:33,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {13037#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13038#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:33,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {13038#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {13038#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:33,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {13038#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13039#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:33,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {13039#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {13021#false} havoc ~i~0;~i~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 46: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 47: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,403 INFO L273 TraceCheckUtils]: 48: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,404 INFO L273 TraceCheckUtils]: 49: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,404 INFO L273 TraceCheckUtils]: 50: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,404 INFO L273 TraceCheckUtils]: 51: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,404 INFO L273 TraceCheckUtils]: 52: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,404 INFO L273 TraceCheckUtils]: 53: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 55: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 56: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 57: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 58: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 59: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 60: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,405 INFO L273 TraceCheckUtils]: 61: Hoare triple {13021#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 62: Hoare triple {13021#false} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 63: Hoare triple {13021#false} ~i~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 64: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 65: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 66: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 67: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 68: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,406 INFO L273 TraceCheckUtils]: 69: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 70: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 71: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 72: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 74: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 75: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 76: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 77: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 79: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 80: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 81: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 82: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 83: Hoare triple {13021#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 84: Hoare triple {13021#false} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 85: Hoare triple {13021#false} ~i~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 86: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 88: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 89: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 90: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 91: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 92: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 93: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 94: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 95: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,409 INFO L273 TraceCheckUtils]: 96: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 97: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 98: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 99: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 100: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 101: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 102: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 103: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 104: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,410 INFO L273 TraceCheckUtils]: 105: Hoare triple {13021#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 106: Hoare triple {13021#false} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 107: Hoare triple {13021#false} ~i~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 108: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 109: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 110: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 111: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 112: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,411 INFO L273 TraceCheckUtils]: 113: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 114: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 115: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 116: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 117: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 118: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 119: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 120: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 121: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,412 INFO L273 TraceCheckUtils]: 122: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 123: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 124: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 125: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 126: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 127: Hoare triple {13021#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 128: Hoare triple {13021#false} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 129: Hoare triple {13021#false} ~i~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 130: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,413 INFO L273 TraceCheckUtils]: 131: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 132: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 133: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 134: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 135: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 136: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 137: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 138: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 139: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,414 INFO L273 TraceCheckUtils]: 140: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 141: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 142: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 143: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 144: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 145: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 146: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 147: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 148: Hoare triple {13021#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; {13021#false} is VALID [2018-11-23 12:00:33,415 INFO L273 TraceCheckUtils]: 149: Hoare triple {13021#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 150: Hoare triple {13021#false} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 151: Hoare triple {13021#false} havoc ~x~0;~x~0 := 0; {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 152: Hoare triple {13021#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L256 TraceCheckUtils]: 153: Hoare triple {13021#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 154: Hoare triple {13021#false} ~cond := #in~cond; {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 155: Hoare triple {13021#false} assume 0 == ~cond; {13021#false} is VALID [2018-11-23 12:00:33,416 INFO L273 TraceCheckUtils]: 156: Hoare triple {13021#false} assume !false; {13021#false} is VALID [2018-11-23 12:00:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-11-23 12:00:33,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:33,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:33,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:33,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:33,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {13020#true} call ULTIMATE.init(); {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {13020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {13020#true} assume true; {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13020#true} {13020#true} #119#return; {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {13020#true} call #t~ret15 := main(); {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {13020#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);havoc ~a~0;~a~0 := 0; {13020#true} is VALID [2018-11-23 12:00:33,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {13020#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {13020#true} assume !(~a~0 < 100000); {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {13020#true} havoc ~i~0;~i~0 := 0; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 49: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 55: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 57: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 60: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {13020#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13020#true} is VALID [2018-11-23 12:00:33,926 INFO L273 TraceCheckUtils]: 62: Hoare triple {13020#true} assume !(~i~0 < 100000); {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 63: Hoare triple {13020#true} ~i~0 := 0; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 64: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 65: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 68: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 69: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 70: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,927 INFO L273 TraceCheckUtils]: 71: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 72: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 73: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 74: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 75: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 78: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 79: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,928 INFO L273 TraceCheckUtils]: 80: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 81: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 82: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 83: Hoare triple {13020#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 84: Hoare triple {13020#true} assume !(~i~0 < 100000); {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 85: Hoare triple {13020#true} ~i~0 := 0; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 86: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 87: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 88: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,929 INFO L273 TraceCheckUtils]: 89: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 90: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 91: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 92: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 93: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 94: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 95: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 96: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 98: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 99: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 100: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 101: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 102: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 104: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 105: Hoare triple {13020#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 106: Hoare triple {13020#true} assume !(~i~0 < 100000); {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 107: Hoare triple {13020#true} ~i~0 := 0; {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 108: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,932 INFO L273 TraceCheckUtils]: 109: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 110: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 111: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 112: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 113: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 114: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,933 INFO L273 TraceCheckUtils]: 115: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 116: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 117: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 118: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 119: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 120: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,934 INFO L273 TraceCheckUtils]: 121: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 122: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 123: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 124: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 125: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 126: Hoare triple {13020#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; {13020#true} is VALID [2018-11-23 12:00:33,935 INFO L273 TraceCheckUtils]: 127: Hoare triple {13020#true} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {13020#true} is VALID [2018-11-23 12:00:33,936 INFO L273 TraceCheckUtils]: 128: Hoare triple {13020#true} assume !(~i~0 < 100000); {13020#true} is VALID [2018-11-23 12:00:33,954 INFO L273 TraceCheckUtils]: 129: Hoare triple {13020#true} ~i~0 := 0; {13430#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:33,967 INFO L273 TraceCheckUtils]: 130: Hoare triple {13430#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13430#(<= main_~i~0 0)} is VALID [2018-11-23 12:00:33,975 INFO L273 TraceCheckUtils]: 131: Hoare triple {13430#(<= main_~i~0 0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:33,987 INFO L273 TraceCheckUtils]: 132: Hoare triple {13437#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13437#(<= main_~i~0 1)} is VALID [2018-11-23 12:00:33,989 INFO L273 TraceCheckUtils]: 133: Hoare triple {13437#(<= main_~i~0 1)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13444#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:33,989 INFO L273 TraceCheckUtils]: 134: Hoare triple {13444#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13444#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:33,992 INFO L273 TraceCheckUtils]: 135: Hoare triple {13444#(<= main_~i~0 2)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13451#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:33,992 INFO L273 TraceCheckUtils]: 136: Hoare triple {13451#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13451#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:33,994 INFO L273 TraceCheckUtils]: 137: Hoare triple {13451#(<= main_~i~0 3)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13458#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:33,994 INFO L273 TraceCheckUtils]: 138: Hoare triple {13458#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13458#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:33,994 INFO L273 TraceCheckUtils]: 139: Hoare triple {13458#(<= main_~i~0 4)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13465#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:33,995 INFO L273 TraceCheckUtils]: 140: Hoare triple {13465#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13465#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:33,995 INFO L273 TraceCheckUtils]: 141: Hoare triple {13465#(<= main_~i~0 5)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13472#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:33,995 INFO L273 TraceCheckUtils]: 142: Hoare triple {13472#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13472#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:33,996 INFO L273 TraceCheckUtils]: 143: Hoare triple {13472#(<= main_~i~0 6)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13479#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:33,996 INFO L273 TraceCheckUtils]: 144: Hoare triple {13479#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13479#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:33,997 INFO L273 TraceCheckUtils]: 145: Hoare triple {13479#(<= main_~i~0 7)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13486#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:33,997 INFO L273 TraceCheckUtils]: 146: Hoare triple {13486#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13486#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:33,998 INFO L273 TraceCheckUtils]: 147: Hoare triple {13486#(<= main_~i~0 8)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13493#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:33,998 INFO L273 TraceCheckUtils]: 148: Hoare triple {13493#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem11 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem11; {13493#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:33,999 INFO L273 TraceCheckUtils]: 149: Hoare triple {13493#(<= main_~i~0 9)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13500#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:33,999 INFO L273 TraceCheckUtils]: 150: Hoare triple {13500#(<= main_~i~0 10)} assume !(~i~0 < 100000); {13021#false} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 151: Hoare triple {13021#false} havoc ~x~0;~x~0 := 0; {13021#false} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 152: Hoare triple {13021#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {13021#false} is VALID [2018-11-23 12:00:34,000 INFO L256 TraceCheckUtils]: 153: Hoare triple {13021#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {13021#false} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 154: Hoare triple {13021#false} ~cond := #in~cond; {13021#false} is VALID [2018-11-23 12:00:34,000 INFO L273 TraceCheckUtils]: 155: Hoare triple {13021#false} assume 0 == ~cond; {13021#false} is VALID [2018-11-23 12:00:34,001 INFO L273 TraceCheckUtils]: 156: Hoare triple {13021#false} assume !false; {13021#false} is VALID [2018-11-23 12:00:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-23 12:00:34,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:34,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2018-11-23 12:00:34,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 157 [2018-11-23 12:00:34,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:34,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:00:34,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:34,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:00:34,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:00:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:34,139 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 31 states. [2018-11-23 12:00:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,994 INFO L93 Difference]: Finished difference Result 301 states and 318 transitions. [2018-11-23 12:00:35,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:00:35,994 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 157 [2018-11-23 12:00:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-11-23 12:00:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:00:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-11-23 12:00:35,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 223 transitions. [2018-11-23 12:00:37,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:37,601 INFO L225 Difference]: With dead ends: 301 [2018-11-23 12:00:37,601 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 12:00:37,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:00:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 12:00:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2018-11-23 12:00:37,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:37,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 174 states. [2018-11-23 12:00:37,773 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 174 states. [2018-11-23 12:00:37,773 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 174 states. [2018-11-23 12:00:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:37,777 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-11-23 12:00:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 186 transitions. [2018-11-23 12:00:37,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:37,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:37,778 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 180 states. [2018-11-23 12:00:37,778 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 180 states. [2018-11-23 12:00:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:37,782 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-11-23 12:00:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 186 transitions. [2018-11-23 12:00:37,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:37,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:37,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:37,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:00:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 180 transitions. [2018-11-23 12:00:37,787 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 180 transitions. Word has length 157 [2018-11-23 12:00:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:37,787 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 180 transitions. [2018-11-23 12:00:37,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:00:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 180 transitions. [2018-11-23 12:00:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 12:00:37,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:37,788 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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:37,789 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:37,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash -758004540, now seen corresponding path program 17 times [2018-11-23 12:00:37,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:37,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:38,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {14586#true} call ULTIMATE.init(); {14586#true} is VALID [2018-11-23 12:00:38,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {14586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14586#true} is VALID [2018-11-23 12:00:38,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {14586#true} assume true; {14586#true} is VALID [2018-11-23 12:00:38,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14586#true} {14586#true} #119#return; {14586#true} is VALID [2018-11-23 12:00:38,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {14586#true} call #t~ret15 := main(); {14586#true} is VALID [2018-11-23 12:00:38,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {14586#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);havoc ~a~0;~a~0 := 0; {14588#(= main_~a~0 0)} is VALID [2018-11-23 12:00:38,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {14588#(= 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; {14588#(= main_~a~0 0)} is VALID [2018-11-23 12:00:38,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {14588#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14589#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {14589#(<= 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; {14589#(<= main_~a~0 1)} is VALID [2018-11-23 12:00:38,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {14589#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14590#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {14590#(<= 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; {14590#(<= main_~a~0 2)} is VALID [2018-11-23 12:00:38,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {14590#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14591#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {14591#(<= 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; {14591#(<= main_~a~0 3)} is VALID [2018-11-23 12:00:38,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {14591#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14592#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {14592#(<= 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; {14592#(<= main_~a~0 4)} is VALID [2018-11-23 12:00:38,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {14592#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14593#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {14593#(<= 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; {14593#(<= main_~a~0 5)} is VALID [2018-11-23 12:00:38,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {14593#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14594#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {14594#(<= 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; {14594#(<= main_~a~0 6)} is VALID [2018-11-23 12:00:38,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {14594#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14595#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {14595#(<= 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; {14595#(<= main_~a~0 7)} is VALID [2018-11-23 12:00:38,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {14595#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14596#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {14596#(<= 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; {14596#(<= main_~a~0 8)} is VALID [2018-11-23 12:00:38,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {14596#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14597#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {14597#(<= 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; {14597#(<= main_~a~0 9)} is VALID [2018-11-23 12:00:38,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {14597#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14598#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {14598#(<= 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; {14598#(<= main_~a~0 10)} is VALID [2018-11-23 12:00:38,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {14598#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14599#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {14599#(<= 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; {14599#(<= main_~a~0 11)} is VALID [2018-11-23 12:00:38,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {14599#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14600#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {14600#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14600#(<= main_~a~0 12)} is VALID [2018-11-23 12:00:38,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {14600#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14601#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {14601#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14601#(<= main_~a~0 13)} is VALID [2018-11-23 12:00:38,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {14601#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14602#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,513 INFO L273 TraceCheckUtils]: 34: Hoare triple {14602#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14602#(<= main_~a~0 14)} is VALID [2018-11-23 12:00:38,514 INFO L273 TraceCheckUtils]: 35: Hoare triple {14602#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14603#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {14603#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14603#(<= main_~a~0 15)} is VALID [2018-11-23 12:00:38,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {14603#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14604#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:38,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {14604#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14604#(<= main_~a~0 16)} is VALID [2018-11-23 12:00:38,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {14604#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14605#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:38,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {14605#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {14605#(<= main_~a~0 17)} is VALID [2018-11-23 12:00:38,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {14605#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14606#(<= main_~a~0 18)} is VALID [2018-11-23 12:00:38,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {14606#(<= main_~a~0 18)} assume !(~a~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 43: Hoare triple {14587#false} havoc ~i~0;~i~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 45: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,520 INFO L273 TraceCheckUtils]: 49: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,520 INFO L273 TraceCheckUtils]: 50: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,520 INFO L273 TraceCheckUtils]: 51: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 57: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 58: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,522 INFO L273 TraceCheckUtils]: 61: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,522 INFO L273 TraceCheckUtils]: 62: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,522 INFO L273 TraceCheckUtils]: 64: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 65: Hoare triple {14587#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 66: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 67: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 69: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 70: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 74: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 75: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 76: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 78: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 79: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 80: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 81: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,524 INFO L273 TraceCheckUtils]: 82: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 83: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 84: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 85: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 86: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 87: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 88: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 89: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 90: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,525 INFO L273 TraceCheckUtils]: 91: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 92: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 93: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 94: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 95: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 96: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 97: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 98: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 99: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,526 INFO L273 TraceCheckUtils]: 100: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 101: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 102: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 103: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 104: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 105: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 106: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 107: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 108: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,527 INFO L273 TraceCheckUtils]: 109: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 110: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 111: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 112: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 113: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 114: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 115: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 116: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 117: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,528 INFO L273 TraceCheckUtils]: 118: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 119: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 120: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 121: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 122: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 123: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 124: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 125: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,529 INFO L273 TraceCheckUtils]: 126: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 127: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 128: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 129: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 130: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 131: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 132: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 133: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 134: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,530 INFO L273 TraceCheckUtils]: 135: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 136: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 137: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 138: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 139: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 140: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 141: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 142: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 143: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 144: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,531 INFO L273 TraceCheckUtils]: 145: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 146: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 147: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 148: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 149: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 150: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 151: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 152: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,532 INFO L273 TraceCheckUtils]: 153: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 154: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 155: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 156: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 157: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 158: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 159: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 160: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 161: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:00:38,533 INFO L273 TraceCheckUtils]: 162: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L273 TraceCheckUtils]: 163: Hoare triple {14587#false} havoc ~x~0;~x~0 := 0; {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L273 TraceCheckUtils]: 164: Hoare triple {14587#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L256 TraceCheckUtils]: 165: Hoare triple {14587#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L273 TraceCheckUtils]: 166: Hoare triple {14587#false} ~cond := #in~cond; {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L273 TraceCheckUtils]: 167: Hoare triple {14587#false} assume 0 == ~cond; {14587#false} is VALID [2018-11-23 12:00:38,534 INFO L273 TraceCheckUtils]: 168: Hoare triple {14587#false} assume !false; {14587#false} is VALID [2018-11-23 12:00:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-23 12:00:38,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:38,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:38,555 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:21,343 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:02:21,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:21,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:21,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {14586#true} call ULTIMATE.init(); {14586#true} is VALID [2018-11-23 12:02:21,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {14586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14586#true} is VALID [2018-11-23 12:02:21,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {14586#true} assume true; {14586#true} is VALID [2018-11-23 12:02:21,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14586#true} {14586#true} #119#return; {14586#true} is VALID [2018-11-23 12:02:21,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {14586#true} call #t~ret15 := main(); {14586#true} is VALID [2018-11-23 12:02:21,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {14586#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);havoc ~a~0;~a~0 := 0; {14586#true} is VALID [2018-11-23 12:02:21,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {14586#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; {14586#true} is VALID [2018-11-23 12:02:21,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {14586#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14586#true} is VALID [2018-11-23 12:02:21,766 INFO L273 TraceCheckUtils]: 42: Hoare triple {14586#true} assume !(~a~0 < 100000); {14586#true} is VALID [2018-11-23 12:02:21,766 INFO L273 TraceCheckUtils]: 43: Hoare triple {14586#true} havoc ~i~0;~i~0 := 0; {14739#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:21,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {14739#(<= 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; {14739#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:21,767 INFO L273 TraceCheckUtils]: 45: Hoare triple {14739#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14746#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:21,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {14746#(<= 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; {14746#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:21,767 INFO L273 TraceCheckUtils]: 47: Hoare triple {14746#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14753#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:21,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {14753#(<= 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; {14753#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:21,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {14753#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14760#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:21,768 INFO L273 TraceCheckUtils]: 50: Hoare triple {14760#(<= 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; {14760#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:21,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {14760#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14767#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:21,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {14767#(<= 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; {14767#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:21,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {14767#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14774#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:21,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {14774#(<= 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; {14774#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:21,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {14774#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14781#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:21,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {14781#(<= 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; {14781#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:21,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {14781#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14788#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:21,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {14788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14788#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:21,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {14788#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14795#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:21,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {14795#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14795#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:21,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {14795#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14802#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:21,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {14802#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14802#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:21,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {14802#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14809#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:21,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {14809#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {14809#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:21,777 INFO L273 TraceCheckUtils]: 65: Hoare triple {14809#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14816#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:21,778 INFO L273 TraceCheckUtils]: 66: Hoare triple {14816#(<= main_~i~0 11)} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:02:21,778 INFO L273 TraceCheckUtils]: 67: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:02:21,778 INFO L273 TraceCheckUtils]: 68: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,778 INFO L273 TraceCheckUtils]: 69: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 71: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 72: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 73: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 74: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,779 INFO L273 TraceCheckUtils]: 75: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,780 INFO L273 TraceCheckUtils]: 76: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,780 INFO L273 TraceCheckUtils]: 77: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,780 INFO L273 TraceCheckUtils]: 78: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,780 INFO L273 TraceCheckUtils]: 79: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 81: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 82: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 83: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 86: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 87: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,781 INFO L273 TraceCheckUtils]: 88: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 89: Hoare triple {14587#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 90: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 91: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 92: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 93: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 96: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,782 INFO L273 TraceCheckUtils]: 97: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 98: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 99: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 100: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 101: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 102: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 103: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 104: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 105: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,783 INFO L273 TraceCheckUtils]: 106: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 107: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 108: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 109: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 110: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 111: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 112: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {14587#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 114: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:02:21,784 INFO L273 TraceCheckUtils]: 115: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 116: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 117: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 118: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 119: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 120: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 121: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 122: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 123: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,785 INFO L273 TraceCheckUtils]: 124: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 125: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 126: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 127: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 128: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 129: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 130: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 131: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 132: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,786 INFO L273 TraceCheckUtils]: 133: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 134: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 135: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 136: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 137: Hoare triple {14587#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 138: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 139: Hoare triple {14587#false} ~i~0 := 0; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 140: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 141: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,787 INFO L273 TraceCheckUtils]: 142: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 143: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 144: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 145: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 146: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 147: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 148: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 149: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 150: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,788 INFO L273 TraceCheckUtils]: 151: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 152: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 153: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 154: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 155: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 156: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 157: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 158: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 159: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,789 INFO L273 TraceCheckUtils]: 160: Hoare triple {14587#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; {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 161: Hoare triple {14587#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 162: Hoare triple {14587#false} assume !(~i~0 < 100000); {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 163: Hoare triple {14587#false} havoc ~x~0;~x~0 := 0; {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 164: Hoare triple {14587#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L256 TraceCheckUtils]: 165: Hoare triple {14587#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 166: Hoare triple {14587#false} ~cond := #in~cond; {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 167: Hoare triple {14587#false} assume 0 == ~cond; {14587#false} is VALID [2018-11-23 12:02:21,790 INFO L273 TraceCheckUtils]: 168: Hoare triple {14587#false} assume !false; {14587#false} is VALID [2018-11-23 12:02:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2018-11-23 12:02:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 33 [2018-11-23 12:02:21,835 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 169 [2018-11-23 12:02:21,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:21,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:02:21,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:21,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:02:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:02:21,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:02:21,943 INFO L87 Difference]: Start difference. First operand 174 states and 180 transitions. Second operand 33 states. [2018-11-23 12:02:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:23,901 INFO L93 Difference]: Finished difference Result 323 states and 340 transitions. [2018-11-23 12:02:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:02:23,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 169 [2018-11-23 12:02:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:02:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 235 transitions. [2018-11-23 12:02:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:02:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 235 transitions. [2018-11-23 12:02:23,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 235 transitions. [2018-11-23 12:02:24,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:24,528 INFO L225 Difference]: With dead ends: 323 [2018-11-23 12:02:24,528 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 12:02:24,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:02:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 12:02:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2018-11-23 12:02:24,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:24,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 186 states. [2018-11-23 12:02:24,684 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 186 states. [2018-11-23 12:02:24,684 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 186 states. [2018-11-23 12:02:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,688 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-11-23 12:02:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-11-23 12:02:24,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,689 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 192 states. [2018-11-23 12:02:24,689 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 192 states. [2018-11-23 12:02:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,693 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-11-23 12:02:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-11-23 12:02:24,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:24,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:02:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 192 transitions. [2018-11-23 12:02:24,698 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 192 transitions. Word has length 169 [2018-11-23 12:02:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:24,698 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 192 transitions. [2018-11-23 12:02:24,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:02:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 192 transitions. [2018-11-23 12:02:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 12:02:24,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:24,700 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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:02:24,700 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:24,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2081558584, now seen corresponding path program 18 times [2018-11-23 12:02:24,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:24,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {16265#true} call ULTIMATE.init(); {16265#true} is VALID [2018-11-23 12:02:25,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {16265#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16265#true} is VALID [2018-11-23 12:02:25,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {16265#true} assume true; {16265#true} is VALID [2018-11-23 12:02:25,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16265#true} {16265#true} #119#return; {16265#true} is VALID [2018-11-23 12:02:25,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {16265#true} call #t~ret15 := main(); {16265#true} is VALID [2018-11-23 12:02:25,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {16265#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);havoc ~a~0;~a~0 := 0; {16267#(= main_~a~0 0)} is VALID [2018-11-23 12:02:25,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {16267#(= 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; {16267#(= main_~a~0 0)} is VALID [2018-11-23 12:02:25,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {16267#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16268#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:25,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {16268#(<= 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; {16268#(<= main_~a~0 1)} is VALID [2018-11-23 12:02:25,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {16268#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16269#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:25,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {16269#(<= 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; {16269#(<= main_~a~0 2)} is VALID [2018-11-23 12:02:25,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {16269#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16270#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:25,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {16270#(<= 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; {16270#(<= main_~a~0 3)} is VALID [2018-11-23 12:02:25,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {16270#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16271#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:25,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {16271#(<= 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; {16271#(<= main_~a~0 4)} is VALID [2018-11-23 12:02:25,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {16271#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16272#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:25,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {16272#(<= 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; {16272#(<= main_~a~0 5)} is VALID [2018-11-23 12:02:25,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {16272#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16273#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:25,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {16273#(<= 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; {16273#(<= main_~a~0 6)} is VALID [2018-11-23 12:02:25,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {16273#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16274#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:25,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {16274#(<= 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; {16274#(<= main_~a~0 7)} is VALID [2018-11-23 12:02:25,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {16274#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16275#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:25,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {16275#(<= 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; {16275#(<= main_~a~0 8)} is VALID [2018-11-23 12:02:25,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {16275#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16276#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:25,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {16276#(<= 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; {16276#(<= main_~a~0 9)} is VALID [2018-11-23 12:02:25,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {16276#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16277#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:25,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {16277#(<= 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; {16277#(<= main_~a~0 10)} is VALID [2018-11-23 12:02:25,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {16277#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16278#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:25,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {16278#(<= 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; {16278#(<= main_~a~0 11)} is VALID [2018-11-23 12:02:25,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {16278#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16279#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:25,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {16279#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16279#(<= main_~a~0 12)} is VALID [2018-11-23 12:02:25,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {16279#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16280#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:25,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {16280#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16280#(<= main_~a~0 13)} is VALID [2018-11-23 12:02:25,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {16280#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16281#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:25,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {16281#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16281#(<= main_~a~0 14)} is VALID [2018-11-23 12:02:25,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {16281#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16282#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:25,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {16282#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16282#(<= main_~a~0 15)} is VALID [2018-11-23 12:02:25,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {16282#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16283#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:25,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {16283#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16283#(<= main_~a~0 16)} is VALID [2018-11-23 12:02:25,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {16283#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16284#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:25,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {16284#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16284#(<= main_~a~0 17)} is VALID [2018-11-23 12:02:25,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {16284#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16285#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:25,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {16285#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1; {16285#(<= main_~a~0 18)} is VALID [2018-11-23 12:02:25,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {16285#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16286#(<= main_~a~0 19)} is VALID [2018-11-23 12:02:25,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {16286#(<= main_~a~0 19)} assume !(~a~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {16266#false} havoc ~i~0;~i~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,980 INFO L273 TraceCheckUtils]: 46: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,981 INFO L273 TraceCheckUtils]: 48: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 53: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 54: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 56: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,982 INFO L273 TraceCheckUtils]: 57: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,983 INFO L273 TraceCheckUtils]: 58: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,983 INFO L273 TraceCheckUtils]: 59: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,983 INFO L273 TraceCheckUtils]: 60: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,983 INFO L273 TraceCheckUtils]: 61: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,983 INFO L273 TraceCheckUtils]: 62: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 63: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 64: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 65: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,984 INFO L273 TraceCheckUtils]: 68: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 69: Hoare triple {16266#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 70: Hoare triple {16266#false} assume !(~i~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 71: Hoare triple {16266#false} ~i~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 72: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 73: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 74: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,985 INFO L273 TraceCheckUtils]: 75: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 76: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 77: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 78: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 79: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 80: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 81: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 82: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 83: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,986 INFO L273 TraceCheckUtils]: 84: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 85: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 86: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 87: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 88: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 89: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 90: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 91: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 92: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,987 INFO L273 TraceCheckUtils]: 93: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 94: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 95: Hoare triple {16266#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 96: Hoare triple {16266#false} assume !(~i~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 97: Hoare triple {16266#false} ~i~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 98: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 99: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 100: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 101: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,988 INFO L273 TraceCheckUtils]: 102: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 103: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 104: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 105: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 106: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 107: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 108: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 109: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 110: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,989 INFO L273 TraceCheckUtils]: 111: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 112: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 113: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 114: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 115: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 116: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 117: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 118: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 119: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,990 INFO L273 TraceCheckUtils]: 120: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 121: Hoare triple {16266#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 122: Hoare triple {16266#false} assume !(~i~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 123: Hoare triple {16266#false} ~i~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 124: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 125: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 126: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 127: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 128: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,991 INFO L273 TraceCheckUtils]: 129: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 130: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 131: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 132: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 133: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 134: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,992 INFO L273 TraceCheckUtils]: 135: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 136: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 137: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 138: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 139: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 140: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,993 INFO L273 TraceCheckUtils]: 141: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 142: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 143: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 144: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 145: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 146: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,994 INFO L273 TraceCheckUtils]: 147: Hoare triple {16266#false} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 148: Hoare triple {16266#false} assume !(~i~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 149: Hoare triple {16266#false} ~i~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 150: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 151: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 152: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,995 INFO L273 TraceCheckUtils]: 153: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 154: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 155: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 156: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 157: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 158: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 159: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,996 INFO L273 TraceCheckUtils]: 160: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 161: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 162: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 163: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 164: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 165: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 166: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 167: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,997 INFO L273 TraceCheckUtils]: 168: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 169: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 170: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 171: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 172: Hoare triple {16266#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; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 173: Hoare triple {16266#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 174: Hoare triple {16266#false} assume !(~i~0 < 100000); {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 175: Hoare triple {16266#false} havoc ~x~0;~x~0 := 0; {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L273 TraceCheckUtils]: 176: Hoare triple {16266#false} assume !!(~x~0 < 100000);call #t~mem13 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~x~0, 4); {16266#false} is VALID [2018-11-23 12:02:25,998 INFO L256 TraceCheckUtils]: 177: Hoare triple {16266#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1 else 0)); {16266#false} is VALID [2018-11-23 12:02:25,999 INFO L273 TraceCheckUtils]: 178: Hoare triple {16266#false} ~cond := #in~cond; {16266#false} is VALID [2018-11-23 12:02:25,999 INFO L273 TraceCheckUtils]: 179: Hoare triple {16266#false} assume 0 == ~cond; {16266#false} is VALID [2018-11-23 12:02:25,999 INFO L273 TraceCheckUtils]: 180: Hoare triple {16266#false} assume !false; {16266#false} is VALID [2018-11-23 12:02:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-23 12:02:26,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:26,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE