java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:53:59,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:53:59,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:53:59,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:53:59,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:53:59,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:53:59,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:53:59,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:53:59,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:53:59,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:53:59,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:53:59,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:53:59,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:53:59,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:53:59,418 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:53:59,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:53:59,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:53:59,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:53:59,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:53:59,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:53:59,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:53:59,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:53:59,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:53:59,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:53:59,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:53:59,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:53:59,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:53:59,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:53:59,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:53:59,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:53:59,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:53:59,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:53:59,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:53:59,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:53:59,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:53:59,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:53:59,451 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-14 16:53:59,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:53:59,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:53:59,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:53:59,475 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:53:59,477 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:53:59,477 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:53:59,477 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:53:59,478 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:53:59,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:53:59,480 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:53:59,480 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:53:59,480 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:53:59,480 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:53:59,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:53:59,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:53:59,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:53:59,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:53:59,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:53:59,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:53:59,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:53:59,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:53:59,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:53:59,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:53:59,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:53:59,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:53:59,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:53:59,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:53:59,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:53:59,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:53:59,573 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:53:59,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 16:53:59,636 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d962d6f/b59955bc4c4e410fafd3986b430aa5e7/FLAG13907c172 [2018-11-14 16:54:00,086 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:54:00,086 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 16:54:00,093 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d962d6f/b59955bc4c4e410fafd3986b430aa5e7/FLAG13907c172 [2018-11-14 16:54:00,108 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d962d6f/b59955bc4c4e410fafd3986b430aa5e7 [2018-11-14 16:54:00,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:54:00,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:54:00,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:54:00,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:54:00,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:54:00,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65741394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00, skipping insertion in model container [2018-11-14 16:54:00,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:54:00,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:54:00,366 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:54:00,371 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:54:00,401 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:54:00,427 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:54:00,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00 WrapperNode [2018-11-14 16:54:00,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:54:00,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:54:00,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:54:00,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:54:00,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... [2018-11-14 16:54:00,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:54:00,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:54:00,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:54:00,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:54:00,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:54:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:54:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:54:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:54:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:54:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:54:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:54:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:54:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:54:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:54:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:54:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:54:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:54:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:54:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:54:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:54:01,576 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:54:01,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:54:01 BoogieIcfgContainer [2018-11-14 16:54:01,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:54:01,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:54:01,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:54:01,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:54:01,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:54:00" (1/3) ... [2018-11-14 16:54:01,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f902630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:54:01, skipping insertion in model container [2018-11-14 16:54:01,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:00" (2/3) ... [2018-11-14 16:54:01,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f902630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:54:01, skipping insertion in model container [2018-11-14 16:54:01,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:54:01" (3/3) ... [2018-11-14 16:54:01,589 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_true-unreach-call_ground.i [2018-11-14 16:54:01,599 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:54:01,612 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:54:01,631 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:54:01,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:54:01,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:54:01,672 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:54:01,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:54:01,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:54:01,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:54:01,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:54:01,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:54:01,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:54:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 16:54:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:54:01,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:01,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:01,706 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:01,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1721942648, now seen corresponding path program 1 times [2018-11-14 16:54:01,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:01,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 16:54:01,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-14 16:54:01,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 16:54:01,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #111#return; {45#true} is VALID [2018-11-14 16:54:01,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret13 := main(); {45#true} is VALID [2018-11-14 16:54:01,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#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);havoc ~a~0;~a~0 := 0; {45#true} is VALID [2018-11-14 16:54:01,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 16:54:01,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0; {46#false} is VALID [2018-11-14 16:54:01,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:54:01,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 16:54:01,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:54:01,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 16:54:01,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:54:01,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 16:54:01,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:54:01,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} havoc ~x~0;~x~0 := 0; {46#false} is VALID [2018-11-14 16:54:01,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:54:01,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {46#false} is VALID [2018-11-14 16:54:01,880 INFO L256 TraceCheckUtils]: 18: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {46#false} is VALID [2018-11-14 16:54:01,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-14 16:54:01,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume ~cond == 0; {46#false} is VALID [2018-11-14 16:54:01,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 16:54:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:01,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:54:01,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:54:01,893 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:54:01,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:01,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:54:01,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:01,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:54:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:54:02,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:54:02,003 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 16:54:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:02,160 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-14 16:54:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:54:02,160 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:54:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:54:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 16:54:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:54:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 16:54:02,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 16:54:02,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:02,537 INFO L225 Difference]: With dead ends: 75 [2018-11-14 16:54:02,537 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 16:54:02,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:54:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 16:54:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 16:54:02,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:02,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 16:54:02,605 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 16:54:02,605 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 16:54:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:02,611 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 16:54:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 16:54:02,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:02,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:02,613 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 16:54:02,613 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 16:54:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:02,618 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 16:54:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 16:54:02,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:02,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:02,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:02,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:54:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 16:54:02,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2018-11-14 16:54:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:02,626 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 16:54:02,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:54:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 16:54:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:54:02,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:02,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:02,628 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:02,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 20971825, now seen corresponding path program 1 times [2018-11-14 16:54:02,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:02,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:02,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:02,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-14 16:54:02,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {266#true} is VALID [2018-11-14 16:54:02,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 16:54:02,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #111#return; {266#true} is VALID [2018-11-14 16:54:02,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret13 := main(); {266#true} is VALID [2018-11-14 16:54:02,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#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);havoc ~a~0;~a~0 := 0; {268#(= main_~a~0 0)} is VALID [2018-11-14 16:54:02,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#(= main_~a~0 0)} assume true; {268#(= main_~a~0 0)} is VALID [2018-11-14 16:54:02,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(= main_~a~0 0)} assume !(~a~0 < 100000); {267#false} is VALID [2018-11-14 16:54:02,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {267#false} havoc ~i~0;~i~0 := 0; {267#false} is VALID [2018-11-14 16:54:02,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 16:54:02,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 16:54:02,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 16:54:02,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 16:54:02,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 16:54:02,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 16:54:02,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 16:54:02,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 16:54:02,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {267#false} ~i~0 := 0; {267#false} is VALID [2018-11-14 16:54:02,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 16:54:02,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {267#false} assume !(~i~0 < 100000); {267#false} is VALID [2018-11-14 16:54:02,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {267#false} havoc ~x~0;~x~0 := 0; {267#false} is VALID [2018-11-14 16:54:02,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 16:54:02,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {267#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {267#false} is VALID [2018-11-14 16:54:02,781 INFO L256 TraceCheckUtils]: 23: Hoare triple {267#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {267#false} is VALID [2018-11-14 16:54:02,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2018-11-14 16:54:02,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {267#false} assume ~cond == 0; {267#false} is VALID [2018-11-14 16:54:02,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-14 16:54:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:02,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:54:02,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:54:02,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:54:02,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:02,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:54:03,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:03,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:54:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:54:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:54:03,061 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 3 states. [2018-11-14 16:54:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,368 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-14 16:54:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:54:03,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:54:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:54:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 16:54:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:54:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 16:54:03,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-14 16:54:03,572 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-14 16:54:03,576 INFO L225 Difference]: With dead ends: 68 [2018-11-14 16:54:03,576 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:54:03,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:54:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:54:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-14 16:54:03,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:03,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-14 16:54:03,599 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-14 16:54:03,599 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-14 16:54:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,602 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 16:54:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 16:54:03,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:03,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:03,603 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-14 16:54:03,603 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-14 16:54:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,606 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 16:54:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 16:54:03,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:03,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:03,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:03,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 16:54:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 16:54:03,611 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-11-14 16:54:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:03,611 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 16:54:03,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:54:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 16:54:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:54:03,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:03,613 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:03,613 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:03,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1906612018, now seen corresponding path program 1 times [2018-11-14 16:54:03,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:03,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:03,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2018-11-14 16:54:03,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {491#true} is VALID [2018-11-14 16:54:03,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 16:54:03,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #111#return; {491#true} is VALID [2018-11-14 16:54:03,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret13 := main(); {491#true} is VALID [2018-11-14 16:54:03,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {491#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);havoc ~a~0;~a~0 := 0; {491#true} is VALID [2018-11-14 16:54:03,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 16:54:03,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {491#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {491#true} is VALID [2018-11-14 16:54:03,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {491#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {491#true} is VALID [2018-11-14 16:54:03,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-14 16:54:03,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {491#true} assume !(~a~0 < 100000); {491#true} is VALID [2018-11-14 16:54:03,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {491#true} havoc ~i~0;~i~0 := 0; {493#(= main_~i~0 0)} is VALID [2018-11-14 16:54:03,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#(= main_~i~0 0)} assume true; {493#(= main_~i~0 0)} is VALID [2018-11-14 16:54:03,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#(= main_~i~0 0)} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 16:54:03,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 16:54:03,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 16:54:03,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 16:54:03,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 16:54:03,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 16:54:03,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 16:54:03,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {492#false} ~i~0 := 0; {492#false} is VALID [2018-11-14 16:54:03,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 16:54:03,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {492#false} assume !(~i~0 < 100000); {492#false} is VALID [2018-11-14 16:54:03,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {492#false} havoc ~x~0;~x~0 := 0; {492#false} is VALID [2018-11-14 16:54:03,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {492#false} assume true; {492#false} is VALID [2018-11-14 16:54:03,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {492#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {492#false} is VALID [2018-11-14 16:54:03,736 INFO L256 TraceCheckUtils]: 26: Hoare triple {492#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {492#false} is VALID [2018-11-14 16:54:03,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2018-11-14 16:54:03,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {492#false} assume ~cond == 0; {492#false} is VALID [2018-11-14 16:54:03,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {492#false} assume !false; {492#false} is VALID [2018-11-14 16:54:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:54:03,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:54:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:54:03,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:54:03,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:03,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:54:03,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:03,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:54:03,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:54:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:54:03,813 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-14 16:54:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,071 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-14 16:54:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:54:04,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:54:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:54:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 16:54:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:54:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 16:54:04,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-14 16:54:04,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:04,229 INFO L225 Difference]: With dead ends: 75 [2018-11-14 16:54:04,230 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 16:54:04,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:54:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 16:54:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 16:54:04,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:04,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 16:54:04,277 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 16:54:04,277 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 16:54:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,281 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:54:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:54:04,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,283 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 16:54:04,283 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 16:54:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,286 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:54:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:54:04,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:04,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:54:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-14 16:54:04,291 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 30 [2018-11-14 16:54:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:04,291 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-14 16:54:04,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:54:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 16:54:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:54:04,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:04,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:04,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:04,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -50907604, now seen corresponding path program 1 times [2018-11-14 16:54:04,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:04,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 16:54:04,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {760#true} is VALID [2018-11-14 16:54:04,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 16:54:04,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #111#return; {760#true} is VALID [2018-11-14 16:54:04,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret13 := main(); {760#true} is VALID [2018-11-14 16:54:04,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {760#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);havoc ~a~0;~a~0 := 0; {762#(= main_~a~0 0)} is VALID [2018-11-14 16:54:04,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#(= main_~a~0 0)} assume true; {762#(= main_~a~0 0)} is VALID [2018-11-14 16:54:04,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {762#(= main_~a~0 0)} is VALID [2018-11-14 16:54:04,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {762#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {763#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:04,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {763#(<= main_~a~0 1)} assume true; {763#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:04,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {763#(<= main_~a~0 1)} assume !(~a~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {761#false} havoc ~i~0;~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {761#false} is VALID [2018-11-14 16:54:04,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {761#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {761#false} is VALID [2018-11-14 16:54:04,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {761#false} is VALID [2018-11-14 16:54:04,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {761#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {761#false} is VALID [2018-11-14 16:54:04,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {761#false} is VALID [2018-11-14 16:54:04,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {761#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {761#false} is VALID [2018-11-14 16:54:04,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,489 INFO L273 TraceCheckUtils]: 31: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {761#false} is VALID [2018-11-14 16:54:04,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {761#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {761#false} is VALID [2018-11-14 16:54:04,490 INFO L273 TraceCheckUtils]: 33: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {761#false} havoc ~x~0;~x~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {761#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {761#false} is VALID [2018-11-14 16:54:04,491 INFO L256 TraceCheckUtils]: 38: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {761#false} is VALID [2018-11-14 16:54:04,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 16:54:04,492 INFO L273 TraceCheckUtils]: 40: Hoare triple {761#false} assume ~cond == 0; {761#false} is VALID [2018-11-14 16:54:04,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 16:54:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:54:04,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:04,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:04,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:04,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 16:54:04,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {760#true} is VALID [2018-11-14 16:54:04,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 16:54:04,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #111#return; {760#true} is VALID [2018-11-14 16:54:04,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret13 := main(); {760#true} is VALID [2018-11-14 16:54:04,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {760#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);havoc ~a~0;~a~0 := 0; {782#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:04,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#(<= main_~a~0 0)} assume true; {782#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:04,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {782#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:04,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {782#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {763#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:04,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {763#(<= main_~a~0 1)} assume true; {763#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:04,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {763#(<= main_~a~0 1)} assume !(~a~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {761#false} havoc ~i~0;~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {761#false} is VALID [2018-11-14 16:54:04,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {761#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {761#false} is VALID [2018-11-14 16:54:04,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {761#false} is VALID [2018-11-14 16:54:04,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {761#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {761#false} is VALID [2018-11-14 16:54:04,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {761#false} is VALID [2018-11-14 16:54:04,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {761#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {761#false} is VALID [2018-11-14 16:54:04,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} ~i~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {761#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {761#false} is VALID [2018-11-14 16:54:04,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {761#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {761#false} is VALID [2018-11-14 16:54:04,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {761#false} assume !(~i~0 < 100000); {761#false} is VALID [2018-11-14 16:54:04,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {761#false} havoc ~x~0;~x~0 := 0; {761#false} is VALID [2018-11-14 16:54:04,893 INFO L273 TraceCheckUtils]: 36: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 16:54:04,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {761#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {761#false} is VALID [2018-11-14 16:54:04,893 INFO L256 TraceCheckUtils]: 38: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {761#false} is VALID [2018-11-14 16:54:04,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 16:54:04,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {761#false} assume ~cond == 0; {761#false} is VALID [2018-11-14 16:54:04,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 16:54:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:54:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:04,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:54:04,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 16:54:04,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:04,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:54:05,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:05,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:54:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:54:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:54:05,065 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 5 states. [2018-11-14 16:54:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:05,302 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-11-14 16:54:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:54:05,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 16:54:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:54:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 16:54:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:54:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 16:54:05,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-14 16:54:05,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:05,435 INFO L225 Difference]: With dead ends: 87 [2018-11-14 16:54:05,435 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 16:54:05,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:54:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 16:54:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 16:54:05,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:05,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 16:54:05,460 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 16:54:05,460 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 16:54:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:05,463 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:54:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:54:05,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:05,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:05,464 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 16:54:05,465 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 16:54:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:05,470 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:54:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:54:05,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:05,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:05,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:05,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:54:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-14 16:54:05,477 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 42 [2018-11-14 16:54:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:05,477 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-14 16:54:05,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:54:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-14 16:54:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:54:05,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:05,486 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:05,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:05,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1851408885, now seen corresponding path program 2 times [2018-11-14 16:54:05,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:05,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:05,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:05,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {1176#true} call ULTIMATE.init(); {1176#true} is VALID [2018-11-14 16:54:05,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {1176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1176#true} is VALID [2018-11-14 16:54:05,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1176#true} {1176#true} #111#return; {1176#true} is VALID [2018-11-14 16:54:05,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {1176#true} call #t~ret13 := main(); {1176#true} is VALID [2018-11-14 16:54:05,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {1176#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);havoc ~a~0;~a~0 := 0; {1178#(= main_~a~0 0)} is VALID [2018-11-14 16:54:05,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~a~0 0)} assume true; {1178#(= main_~a~0 0)} is VALID [2018-11-14 16:54:05,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {1178#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1178#(= main_~a~0 0)} is VALID [2018-11-14 16:54:05,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {1178#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:05,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {1179#(<= main_~a~0 1)} assume true; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:05,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {1179#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1179#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:05,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {1179#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1180#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:05,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {1180#(<= main_~a~0 2)} assume true; {1180#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:05,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {1180#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#false} havoc ~i~0;~i~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1177#false} is VALID [2018-11-14 16:54:05,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {1177#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1177#false} is VALID [2018-11-14 16:54:05,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1177#false} is VALID [2018-11-14 16:54:05,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {1177#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1177#false} is VALID [2018-11-14 16:54:05,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1177#false} is VALID [2018-11-14 16:54:05,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {1177#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1177#false} is VALID [2018-11-14 16:54:05,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {1177#false} ~i~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {1177#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1177#false} is VALID [2018-11-14 16:54:05,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {1177#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1177#false} is VALID [2018-11-14 16:54:05,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {1177#false} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {1177#false} havoc ~x~0;~x~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {1177#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1177#false} is VALID [2018-11-14 16:54:05,690 INFO L256 TraceCheckUtils]: 41: Hoare triple {1177#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1177#false} is VALID [2018-11-14 16:54:05,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {1177#false} ~cond := #in~cond; {1177#false} is VALID [2018-11-14 16:54:05,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {1177#false} assume ~cond == 0; {1177#false} is VALID [2018-11-14 16:54:05,691 INFO L273 TraceCheckUtils]: 44: Hoare triple {1177#false} assume !false; {1177#false} is VALID [2018-11-14 16:54:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:54:05,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:05,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:05,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:05,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:05,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:05,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:05,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {1176#true} call ULTIMATE.init(); {1176#true} is VALID [2018-11-14 16:54:05,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {1176#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1176#true} is VALID [2018-11-14 16:54:05,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1176#true} {1176#true} #111#return; {1176#true} is VALID [2018-11-14 16:54:05,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {1176#true} call #t~ret13 := main(); {1176#true} is VALID [2018-11-14 16:54:05,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {1176#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);havoc ~a~0;~a~0 := 0; {1176#true} is VALID [2018-11-14 16:54:05,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {1176#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1176#true} is VALID [2018-11-14 16:54:05,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {1176#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1176#true} is VALID [2018-11-14 16:54:05,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1176#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1176#true} is VALID [2018-11-14 16:54:05,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {1176#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1176#true} is VALID [2018-11-14 16:54:05,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {1176#true} assume !(~a~0 < 100000); {1176#true} is VALID [2018-11-14 16:54:05,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {1176#true} havoc ~i~0;~i~0 := 0; {1176#true} is VALID [2018-11-14 16:54:05,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1176#true} is VALID [2018-11-14 16:54:05,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1176#true} is VALID [2018-11-14 16:54:05,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 16:54:05,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {1176#true} ~i~0 := 0; {1176#true} is VALID [2018-11-14 16:54:05,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1176#true} is VALID [2018-11-14 16:54:05,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1176#true} is VALID [2018-11-14 16:54:05,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 16:54:05,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#true} ~i~0 := 0; {1176#true} is VALID [2018-11-14 16:54:05,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {1176#true} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1176#true} is VALID [2018-11-14 16:54:05,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {1176#true} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1176#true} is VALID [2018-11-14 16:54:05,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {1176#true} assume true; {1176#true} is VALID [2018-11-14 16:54:05,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {1176#true} assume !(~i~0 < 100000); {1176#true} is VALID [2018-11-14 16:54:05,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {1176#true} ~i~0 := 0; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:05,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {1280#(<= main_~i~0 0)} assume true; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:05,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {1280#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1280#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:05,994 INFO L273 TraceCheckUtils]: 35: Hoare triple {1280#(<= main_~i~0 0)} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:05,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {1290#(<= main_~i~0 1)} assume true; {1290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:05,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {1290#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1177#false} is VALID [2018-11-14 16:54:05,996 INFO L273 TraceCheckUtils]: 38: Hoare triple {1177#false} havoc ~x~0;~x~0 := 0; {1177#false} is VALID [2018-11-14 16:54:05,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {1177#false} assume true; {1177#false} is VALID [2018-11-14 16:54:05,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {1177#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1177#false} is VALID [2018-11-14 16:54:05,997 INFO L256 TraceCheckUtils]: 41: Hoare triple {1177#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1177#false} is VALID [2018-11-14 16:54:05,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {1177#false} ~cond := #in~cond; {1177#false} is VALID [2018-11-14 16:54:05,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {1177#false} assume ~cond == 0; {1177#false} is VALID [2018-11-14 16:54:05,998 INFO L273 TraceCheckUtils]: 44: Hoare triple {1177#false} assume !false; {1177#false} is VALID [2018-11-14 16:54:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-14 16:54:06,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:06,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 16:54:06,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 16:54:06,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:06,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:54:06,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:06,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:54:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:54:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:54:06,208 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-11-14 16:54:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,617 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 16:54:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:54:06,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 16:54:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:54:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2018-11-14 16:54:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:54:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2018-11-14 16:54:06,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 112 transitions. [2018-11-14 16:54:06,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:06,811 INFO L225 Difference]: With dead ends: 106 [2018-11-14 16:54:06,811 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:54:06,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:54:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:54:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-11-14 16:54:06,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:06,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 65 states. [2018-11-14 16:54:06,860 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 65 states. [2018-11-14 16:54:06,861 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 65 states. [2018-11-14 16:54:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,864 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 16:54:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 16:54:06,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:06,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:06,866 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 70 states. [2018-11-14 16:54:06,866 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 70 states. [2018-11-14 16:54:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,869 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-14 16:54:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-14 16:54:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:06,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:06,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 16:54:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-14 16:54:06,873 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 45 [2018-11-14 16:54:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:06,874 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-14 16:54:06,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:54:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-14 16:54:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 16:54:06,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:06,876 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-11-14 16:54:06,876 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:06,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1796329582, now seen corresponding path program 3 times [2018-11-14 16:54:06,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:06,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:06,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:07,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 16:54:07,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1685#true} is VALID [2018-11-14 16:54:07,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #111#return; {1685#true} is VALID [2018-11-14 16:54:07,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret13 := main(); {1685#true} is VALID [2018-11-14 16:54:07,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#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);havoc ~a~0;~a~0 := 0; {1687#(= main_~a~0 0)} is VALID [2018-11-14 16:54:07,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#(= main_~a~0 0)} assume true; {1687#(= main_~a~0 0)} is VALID [2018-11-14 16:54:07,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1687#(= main_~a~0 0)} is VALID [2018-11-14 16:54:07,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:07,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {1688#(<= main_~a~0 1)} assume true; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:07,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {1688#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1688#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:07,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {1688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:07,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {1689#(<= main_~a~0 2)} assume true; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:07,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {1689#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1689#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:07,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {1689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1690#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:07,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#(<= main_~a~0 3)} assume true; {1690#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:07,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {1686#false} havoc ~i~0;~i~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1686#false} is VALID [2018-11-14 16:54:07,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {1686#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1686#false} is VALID [2018-11-14 16:54:07,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1686#false} is VALID [2018-11-14 16:54:07,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {1686#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1686#false} is VALID [2018-11-14 16:54:07,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1686#false} is VALID [2018-11-14 16:54:07,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {1686#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1686#false} is VALID [2018-11-14 16:54:07,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1686#false} is VALID [2018-11-14 16:54:07,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {1686#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1686#false} is VALID [2018-11-14 16:54:07,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,045 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1686#false} is VALID [2018-11-14 16:54:07,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1686#false} is VALID [2018-11-14 16:54:07,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1686#false} is VALID [2018-11-14 16:54:07,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1686#false} is VALID [2018-11-14 16:54:07,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 16:54:07,048 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 16:54:07,048 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 16:54:07,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 16:54:07,049 INFO L273 TraceCheckUtils]: 51: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,049 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} havoc ~x~0;~x~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,050 INFO L273 TraceCheckUtils]: 55: Hoare triple {1686#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1686#false} is VALID [2018-11-14 16:54:07,050 INFO L256 TraceCheckUtils]: 56: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1686#false} is VALID [2018-11-14 16:54:07,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 16:54:07,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 16:54:07,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 16:54:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-14 16:54:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:07,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:07,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:07,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:54:07,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:07,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:07,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 16:54:07,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1685#true} is VALID [2018-11-14 16:54:07,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #111#return; {1685#true} is VALID [2018-11-14 16:54:07,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret13 := main(); {1685#true} is VALID [2018-11-14 16:54:07,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#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);havoc ~a~0;~a~0 := 0; {1685#true} is VALID [2018-11-14 16:54:07,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 16:54:07,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 16:54:07,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 16:54:07,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 16:54:07,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {1685#true} is VALID [2018-11-14 16:54:07,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {1685#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1685#true} is VALID [2018-11-14 16:54:07,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {1685#true} assume !(~a~0 < 100000); {1685#true} is VALID [2018-11-14 16:54:07,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1685#true} havoc ~i~0;~i~0 := 0; {1685#true} is VALID [2018-11-14 16:54:07,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1685#true} is VALID [2018-11-14 16:54:07,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {1685#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1685#true} is VALID [2018-11-14 16:54:07,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1685#true} is VALID [2018-11-14 16:54:07,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {1685#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1685#true} is VALID [2018-11-14 16:54:07,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {1685#true} assume !(~i~0 < 100000); {1685#true} is VALID [2018-11-14 16:54:07,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {1685#true} ~i~0 := 0; {1685#true} is VALID [2018-11-14 16:54:07,325 INFO L273 TraceCheckUtils]: 27: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1685#true} is VALID [2018-11-14 16:54:07,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {1685#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1685#true} is VALID [2018-11-14 16:54:07,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {1685#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1685#true} is VALID [2018-11-14 16:54:07,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {1685#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1685#true} is VALID [2018-11-14 16:54:07,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 16:54:07,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {1685#true} assume !(~i~0 < 100000); {1685#true} is VALID [2018-11-14 16:54:07,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {1685#true} ~i~0 := 0; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:07,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {1799#(<= main_~i~0 0)} assume true; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:07,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {1799#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1799#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:07,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {1799#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:07,342 INFO L273 TraceCheckUtils]: 39: Hoare triple {1809#(<= main_~i~0 1)} assume true; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:07,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {1809#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1809#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:07,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {1809#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1819#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {1819#(<= main_~i~0 2)} assume true; {1819#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {1819#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 16:54:07,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 16:54:07,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {1686#false} is VALID [2018-11-14 16:54:07,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {1686#false} is VALID [2018-11-14 16:54:07,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} assume !(~i~0 < 100000); {1686#false} is VALID [2018-11-14 16:54:07,352 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} havoc ~x~0;~x~0 := 0; {1686#false} is VALID [2018-11-14 16:54:07,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 16:54:07,352 INFO L273 TraceCheckUtils]: 55: Hoare triple {1686#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {1686#false} is VALID [2018-11-14 16:54:07,352 INFO L256 TraceCheckUtils]: 56: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {1686#false} is VALID [2018-11-14 16:54:07,353 INFO L273 TraceCheckUtils]: 57: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 16:54:07,353 INFO L273 TraceCheckUtils]: 58: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 16:54:07,353 INFO L273 TraceCheckUtils]: 59: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 16:54:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 16:54:07,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:07,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 16:54:07,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 16:54:07,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:07,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:54:07,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:07,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:54:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:54:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:54:07,592 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 9 states. [2018-11-14 16:54:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:08,340 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-14 16:54:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:54:08,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 16:54:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:54:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2018-11-14 16:54:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:54:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2018-11-14 16:54:08,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 127 transitions. [2018-11-14 16:54:08,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:08,552 INFO L225 Difference]: With dead ends: 133 [2018-11-14 16:54:08,552 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 16:54:08,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:54:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 16:54:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-14 16:54:08,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:08,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 80 states. [2018-11-14 16:54:08,630 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 80 states. [2018-11-14 16:54:08,630 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 80 states. [2018-11-14 16:54:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:08,634 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-14 16:54:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-14 16:54:08,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:08,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:08,635 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 85 states. [2018-11-14 16:54:08,635 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 85 states. [2018-11-14 16:54:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:08,638 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-14 16:54:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-14 16:54:08,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:08,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:08,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:08,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:54:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 16:54:08,642 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 60 [2018-11-14 16:54:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:08,643 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 16:54:08,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:54:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 16:54:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 16:54:08,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:08,644 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2018-11-14 16:54:08,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:08,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash 499349291, now seen corresponding path program 4 times [2018-11-14 16:54:08,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:08,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:08,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:09,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2327#true} call ULTIMATE.init(); {2327#true} is VALID [2018-11-14 16:54:09,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {2327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2327#true} is VALID [2018-11-14 16:54:09,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {2327#true} assume true; {2327#true} is VALID [2018-11-14 16:54:09,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2327#true} {2327#true} #111#return; {2327#true} is VALID [2018-11-14 16:54:09,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {2327#true} call #t~ret13 := main(); {2327#true} is VALID [2018-11-14 16:54:09,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {2327#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);havoc ~a~0;~a~0 := 0; {2329#(= main_~a~0 0)} is VALID [2018-11-14 16:54:09,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {2329#(= main_~a~0 0)} assume true; {2329#(= main_~a~0 0)} is VALID [2018-11-14 16:54:09,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {2329#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2329#(= main_~a~0 0)} is VALID [2018-11-14 16:54:09,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {2329#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {2330#(<= main_~a~0 1)} assume true; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {2330#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {2330#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {2331#(<= main_~a~0 2)} assume true; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {2331#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {2331#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {2332#(<= main_~a~0 3)} assume true; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {2332#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {2332#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:09,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#(<= main_~a~0 4)} assume true; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:09,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {2328#false} havoc ~i~0;~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 48: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 52: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 56: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 57: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,278 INFO L273 TraceCheckUtils]: 62: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,278 INFO L273 TraceCheckUtils]: 63: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,278 INFO L273 TraceCheckUtils]: 64: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,278 INFO L273 TraceCheckUtils]: 65: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,279 INFO L273 TraceCheckUtils]: 66: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,279 INFO L273 TraceCheckUtils]: 67: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {2328#false} havoc ~x~0;~x~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,279 INFO L273 TraceCheckUtils]: 69: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {2328#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {2328#false} is VALID [2018-11-14 16:54:09,280 INFO L256 TraceCheckUtils]: 71: Hoare triple {2328#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2328#false} is VALID [2018-11-14 16:54:09,280 INFO L273 TraceCheckUtils]: 72: Hoare triple {2328#false} ~cond := #in~cond; {2328#false} is VALID [2018-11-14 16:54:09,280 INFO L273 TraceCheckUtils]: 73: Hoare triple {2328#false} assume ~cond == 0; {2328#false} is VALID [2018-11-14 16:54:09,280 INFO L273 TraceCheckUtils]: 74: Hoare triple {2328#false} assume !false; {2328#false} is VALID [2018-11-14 16:54:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:54:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:09,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:09,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:54:09,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:54:09,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:09,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:09,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {2327#true} call ULTIMATE.init(); {2327#true} is VALID [2018-11-14 16:54:09,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {2327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2327#true} is VALID [2018-11-14 16:54:09,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {2327#true} assume true; {2327#true} is VALID [2018-11-14 16:54:09,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2327#true} {2327#true} #111#return; {2327#true} is VALID [2018-11-14 16:54:09,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {2327#true} call #t~ret13 := main(); {2327#true} is VALID [2018-11-14 16:54:09,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {2327#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);havoc ~a~0;~a~0 := 0; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:09,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {2352#(<= main_~a~0 0)} assume true; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:09,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {2352#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2352#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:09,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {2352#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {2330#(<= main_~a~0 1)} assume true; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {2330#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2330#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:09,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {2330#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {2331#(<= main_~a~0 2)} assume true; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {2331#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2331#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:09,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {2331#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {2332#(<= main_~a~0 3)} assume true; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {2332#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {2332#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:09,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {2332#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:09,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#(<= main_~a~0 4)} assume true; {2333#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:09,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {2328#false} havoc ~i~0;~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2328#false} is VALID [2018-11-14 16:54:09,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {2328#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2328#false} is VALID [2018-11-14 16:54:09,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 38: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,597 INFO L273 TraceCheckUtils]: 39: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2328#false} is VALID [2018-11-14 16:54:09,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {2328#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2328#false} is VALID [2018-11-14 16:54:09,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,600 INFO L273 TraceCheckUtils]: 50: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2328#false} is VALID [2018-11-14 16:54:09,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {2328#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2328#false} is VALID [2018-11-14 16:54:09,600 INFO L273 TraceCheckUtils]: 54: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 56: Hoare triple {2328#false} ~i~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 57: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 58: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,601 INFO L273 TraceCheckUtils]: 60: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,602 INFO L273 TraceCheckUtils]: 61: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,602 INFO L273 TraceCheckUtils]: 62: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,602 INFO L273 TraceCheckUtils]: 64: Hoare triple {2328#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {2328#false} is VALID [2018-11-14 16:54:09,603 INFO L273 TraceCheckUtils]: 65: Hoare triple {2328#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {2328#false} is VALID [2018-11-14 16:54:09,603 INFO L273 TraceCheckUtils]: 66: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {2328#false} assume !(~i~0 < 100000); {2328#false} is VALID [2018-11-14 16:54:09,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {2328#false} havoc ~x~0;~x~0 := 0; {2328#false} is VALID [2018-11-14 16:54:09,604 INFO L273 TraceCheckUtils]: 69: Hoare triple {2328#false} assume true; {2328#false} is VALID [2018-11-14 16:54:09,604 INFO L273 TraceCheckUtils]: 70: Hoare triple {2328#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {2328#false} is VALID [2018-11-14 16:54:09,604 INFO L256 TraceCheckUtils]: 71: Hoare triple {2328#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {2328#false} is VALID [2018-11-14 16:54:09,604 INFO L273 TraceCheckUtils]: 72: Hoare triple {2328#false} ~cond := #in~cond; {2328#false} is VALID [2018-11-14 16:54:09,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {2328#false} assume ~cond == 0; {2328#false} is VALID [2018-11-14 16:54:09,605 INFO L273 TraceCheckUtils]: 74: Hoare triple {2328#false} assume !false; {2328#false} is VALID [2018-11-14 16:54:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:54:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:54:09,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-11-14 16:54:09,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:09,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:54:09,842 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-14 16:54:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:54:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:54:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:54:09,843 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 8 states. [2018-11-14 16:54:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:10,311 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 16:54:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:54:10,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-11-14 16:54:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:54:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-14 16:54:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:54:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-14 16:54:10,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-14 16:54:10,405 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-14 16:54:10,407 INFO L225 Difference]: With dead ends: 144 [2018-11-14 16:54:10,407 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:54:10,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:54:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:54:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-14 16:54:10,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:10,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-14 16:54:10,451 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-14 16:54:10,451 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-14 16:54:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:10,454 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 16:54:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 16:54:10,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:10,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:10,454 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-14 16:54:10,454 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-14 16:54:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:10,457 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-14 16:54:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 16:54:10,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:10,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:10,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:10,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:54:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-11-14 16:54:10,460 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 75 [2018-11-14 16:54:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:10,460 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-14 16:54:10,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:54:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-14 16:54:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 16:54:10,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:10,461 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 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] [2018-11-14 16:54:10,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1441638188, now seen corresponding path program 5 times [2018-11-14 16:54:10,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:10,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:10,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:10,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {3031#true} call ULTIMATE.init(); {3031#true} is VALID [2018-11-14 16:54:10,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {3031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3031#true} is VALID [2018-11-14 16:54:10,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:10,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3031#true} {3031#true} #111#return; {3031#true} is VALID [2018-11-14 16:54:10,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {3031#true} call #t~ret13 := main(); {3031#true} is VALID [2018-11-14 16:54:10,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {3031#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);havoc ~a~0;~a~0 := 0; {3033#(= main_~a~0 0)} is VALID [2018-11-14 16:54:10,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {3033#(= main_~a~0 0)} assume true; {3033#(= main_~a~0 0)} is VALID [2018-11-14 16:54:10,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {3033#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3033#(= main_~a~0 0)} is VALID [2018-11-14 16:54:10,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {3033#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:10,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {3034#(<= main_~a~0 1)} assume true; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:10,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {3034#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3034#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:10,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {3034#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:10,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {3035#(<= main_~a~0 2)} assume true; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:10,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {3035#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3035#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:10,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {3035#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:10,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {3036#(<= main_~a~0 3)} assume true; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:10,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {3036#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3036#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:10,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {3036#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:10,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {3037#(<= main_~a~0 4)} assume true; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:10,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {3037#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3037#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:10,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {3037#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3038#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:10,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {3038#(<= main_~a~0 5)} assume true; {3038#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:10,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {3038#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:10,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {3032#false} havoc ~i~0;~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:10,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3032#false} is VALID [2018-11-14 16:54:10,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {3032#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:10,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:10,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:10,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:10,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 46: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 47: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:10,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 51: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 52: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:10,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 58: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 60: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 61: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:10,687 INFO L273 TraceCheckUtils]: 62: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:10,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:10,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:10,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,688 INFO L273 TraceCheckUtils]: 67: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 68: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 69: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 70: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 71: Hoare triple {3032#false} havoc ~x~0;~x~0 := 0; {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 72: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:10,689 INFO L273 TraceCheckUtils]: 73: Hoare triple {3032#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3032#false} is VALID [2018-11-14 16:54:10,690 INFO L256 TraceCheckUtils]: 74: Hoare triple {3032#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3032#false} is VALID [2018-11-14 16:54:10,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {3032#false} ~cond := #in~cond; {3032#false} is VALID [2018-11-14 16:54:10,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {3032#false} assume ~cond == 0; {3032#false} is VALID [2018-11-14 16:54:10,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {3032#false} assume !false; {3032#false} is VALID [2018-11-14 16:54:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:54:10,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:10,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:54:12,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:54:12,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:12,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:12,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {3031#true} call ULTIMATE.init(); {3031#true} is VALID [2018-11-14 16:54:12,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {3031#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3031#true} is VALID [2018-11-14 16:54:12,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3031#true} {3031#true} #111#return; {3031#true} is VALID [2018-11-14 16:54:12,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {3031#true} call #t~ret13 := main(); {3031#true} is VALID [2018-11-14 16:54:12,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {3031#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);havoc ~a~0;~a~0 := 0; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 16:54:12,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {3031#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3031#true} is VALID [2018-11-14 16:54:12,275 INFO L273 TraceCheckUtils]: 20: Hoare triple {3031#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3031#true} is VALID [2018-11-14 16:54:12,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {3031#true} assume true; {3031#true} is VALID [2018-11-14 16:54:12,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {3031#true} assume !(~a~0 < 100000); {3031#true} is VALID [2018-11-14 16:54:12,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {3031#true} havoc ~i~0;~i~0 := 0; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:12,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#(<= main_~i~0 0)} assume true; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:12,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3111#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:12,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {3121#(<= main_~i~0 1)} assume true; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {3121#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3121#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {3121#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {3131#(<= main_~i~0 2)} assume true; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {3131#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3131#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {3131#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3141#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {3141#(<= main_~i~0 3)} assume true; {3141#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {3141#(<= main_~i~0 3)} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:12,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:12,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:12,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:12,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:12,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:12,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3032#false} is VALID [2018-11-14 16:54:12,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {3032#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3032#false} is VALID [2018-11-14 16:54:12,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:12,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:12,283 INFO L273 TraceCheckUtils]: 48: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,283 INFO L273 TraceCheckUtils]: 49: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:12,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:12,284 INFO L273 TraceCheckUtils]: 51: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,284 INFO L273 TraceCheckUtils]: 52: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:12,284 INFO L273 TraceCheckUtils]: 53: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:12,284 INFO L273 TraceCheckUtils]: 54: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,284 INFO L273 TraceCheckUtils]: 55: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {3032#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 57: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 58: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 59: Hoare triple {3032#false} ~i~0 := 0; {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,285 INFO L273 TraceCheckUtils]: 61: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 63: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 64: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 65: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 66: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,286 INFO L273 TraceCheckUtils]: 67: Hoare triple {3032#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3032#false} is VALID [2018-11-14 16:54:12,287 INFO L273 TraceCheckUtils]: 68: Hoare triple {3032#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3032#false} is VALID [2018-11-14 16:54:12,287 INFO L273 TraceCheckUtils]: 69: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,287 INFO L273 TraceCheckUtils]: 70: Hoare triple {3032#false} assume !(~i~0 < 100000); {3032#false} is VALID [2018-11-14 16:54:12,287 INFO L273 TraceCheckUtils]: 71: Hoare triple {3032#false} havoc ~x~0;~x~0 := 0; {3032#false} is VALID [2018-11-14 16:54:12,287 INFO L273 TraceCheckUtils]: 72: Hoare triple {3032#false} assume true; {3032#false} is VALID [2018-11-14 16:54:12,288 INFO L273 TraceCheckUtils]: 73: Hoare triple {3032#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3032#false} is VALID [2018-11-14 16:54:12,288 INFO L256 TraceCheckUtils]: 74: Hoare triple {3032#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3032#false} is VALID [2018-11-14 16:54:12,288 INFO L273 TraceCheckUtils]: 75: Hoare triple {3032#false} ~cond := #in~cond; {3032#false} is VALID [2018-11-14 16:54:12,288 INFO L273 TraceCheckUtils]: 76: Hoare triple {3032#false} assume ~cond == 0; {3032#false} is VALID [2018-11-14 16:54:12,288 INFO L273 TraceCheckUtils]: 77: Hoare triple {3032#false} assume !false; {3032#false} is VALID [2018-11-14 16:54:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-14 16:54:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 16:54:12,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-14 16:54:12,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:12,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:54:12,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:12,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:54:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:54:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:12,442 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 12 states. [2018-11-14 16:54:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:13,301 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2018-11-14 16:54:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:54:13,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-14 16:54:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2018-11-14 16:54:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2018-11-14 16:54:13,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2018-11-14 16:54:13,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:13,480 INFO L225 Difference]: With dead ends: 163 [2018-11-14 16:54:13,480 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 16:54:13,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 16:54:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-14 16:54:13,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:13,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 98 states. [2018-11-14 16:54:13,515 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 98 states. [2018-11-14 16:54:13,516 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 98 states. [2018-11-14 16:54:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:13,519 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 16:54:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-11-14 16:54:13,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:13,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:13,520 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 103 states. [2018-11-14 16:54:13,520 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 103 states. [2018-11-14 16:54:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:13,523 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 16:54:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-11-14 16:54:13,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:13,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:13,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:13,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:54:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-11-14 16:54:13,528 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 78 [2018-11-14 16:54:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:13,528 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-11-14 16:54:13,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:54:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-11-14 16:54:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 16:54:13,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:13,530 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 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] [2018-11-14 16:54:13,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:13,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1083739601, now seen corresponding path program 6 times [2018-11-14 16:54:13,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:13,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:13,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2018-11-14 16:54:13,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3830#true} is VALID [2018-11-14 16:54:13,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2018-11-14 16:54:13,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #111#return; {3830#true} is VALID [2018-11-14 16:54:13,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret13 := main(); {3830#true} is VALID [2018-11-14 16:54:13,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {3830#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);havoc ~a~0;~a~0 := 0; {3832#(= main_~a~0 0)} is VALID [2018-11-14 16:54:13,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {3832#(= main_~a~0 0)} assume true; {3832#(= main_~a~0 0)} is VALID [2018-11-14 16:54:13,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {3832#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3832#(= main_~a~0 0)} is VALID [2018-11-14 16:54:13,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {3832#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:13,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {3833#(<= main_~a~0 1)} assume true; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:13,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:13,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:13,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~a~0 2)} assume true; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:13,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:13,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {3834#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:13,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~a~0 3)} assume true; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:13,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {3835#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:13,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {3835#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:13,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {3836#(<= main_~a~0 4)} assume true; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:13,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {3836#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:13,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {3836#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:13,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {3837#(<= main_~a~0 5)} assume true; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:13,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {3837#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:13,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {3837#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:13,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {3838#(<= main_~a~0 6)} assume true; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:13,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {3838#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:13,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#false} havoc ~i~0;~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:13,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:13,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:13,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:13,773 INFO L273 TraceCheckUtils]: 32: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:13,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:13,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:13,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:13,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:13,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:13,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:13,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:13,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:13,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:13,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:13,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:13,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:13,778 INFO L273 TraceCheckUtils]: 51: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,778 INFO L273 TraceCheckUtils]: 52: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:13,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:13,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 55: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 58: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:13,779 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,780 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:13,780 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:13,780 INFO L273 TraceCheckUtils]: 63: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,780 INFO L273 TraceCheckUtils]: 64: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:13,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 67: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 70: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:13,781 INFO L273 TraceCheckUtils]: 71: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 72: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 73: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 75: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 76: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:13,782 INFO L273 TraceCheckUtils]: 77: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 78: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 79: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 80: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 81: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 82: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:13,783 INFO L273 TraceCheckUtils]: 83: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:13,784 INFO L273 TraceCheckUtils]: 84: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,784 INFO L273 TraceCheckUtils]: 85: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:13,784 INFO L273 TraceCheckUtils]: 86: Hoare triple {3831#false} havoc ~x~0;~x~0 := 0; {3831#false} is VALID [2018-11-14 16:54:13,784 INFO L273 TraceCheckUtils]: 87: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:13,784 INFO L273 TraceCheckUtils]: 88: Hoare triple {3831#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3831#false} is VALID [2018-11-14 16:54:13,785 INFO L256 TraceCheckUtils]: 89: Hoare triple {3831#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3831#false} is VALID [2018-11-14 16:54:13,785 INFO L273 TraceCheckUtils]: 90: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2018-11-14 16:54:13,785 INFO L273 TraceCheckUtils]: 91: Hoare triple {3831#false} assume ~cond == 0; {3831#false} is VALID [2018-11-14 16:54:13,785 INFO L273 TraceCheckUtils]: 92: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2018-11-14 16:54:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:13,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:13,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:54:14,068 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:54:14,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:14,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:14,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2018-11-14 16:54:14,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3830#true} is VALID [2018-11-14 16:54:14,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2018-11-14 16:54:14,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #111#return; {3830#true} is VALID [2018-11-14 16:54:14,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret13 := main(); {3830#true} is VALID [2018-11-14 16:54:14,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {3830#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);havoc ~a~0;~a~0 := 0; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:14,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {3857#(<= main_~a~0 0)} assume true; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:14,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {3857#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:14,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:14,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {3833#(<= main_~a~0 1)} assume true; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:14,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3833#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:14,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:14,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~a~0 2)} assume true; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:14,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3834#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:14,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {3834#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:14,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~a~0 3)} assume true; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:14,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {3835#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3835#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:14,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {3835#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:14,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {3836#(<= main_~a~0 4)} assume true; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:14,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {3836#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3836#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:14,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {3836#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:14,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {3837#(<= main_~a~0 5)} assume true; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:14,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {3837#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {3837#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:14,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {3837#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:14,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {3838#(<= main_~a~0 6)} assume true; {3838#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:14,506 INFO L273 TraceCheckUtils]: 25: Hoare triple {3838#(<= main_~a~0 6)} assume !(~a~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:14,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#false} havoc ~i~0;~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {3831#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:14,508 INFO L273 TraceCheckUtils]: 42: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 47: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 48: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:14,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 53: Hoare triple {3831#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:14,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:14,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,511 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:14,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:14,511 INFO L273 TraceCheckUtils]: 63: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 65: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 68: Hoare triple {3831#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 69: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:14,512 INFO L273 TraceCheckUtils]: 71: Hoare triple {3831#false} ~i~0 := 0; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 72: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 73: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 74: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 75: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 76: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:14,513 INFO L273 TraceCheckUtils]: 77: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 78: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 80: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 81: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 82: Hoare triple {3831#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {3831#false} is VALID [2018-11-14 16:54:14,514 INFO L273 TraceCheckUtils]: 83: Hoare triple {3831#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L273 TraceCheckUtils]: 84: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L273 TraceCheckUtils]: 85: Hoare triple {3831#false} assume !(~i~0 < 100000); {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L273 TraceCheckUtils]: 86: Hoare triple {3831#false} havoc ~x~0;~x~0 := 0; {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L273 TraceCheckUtils]: 87: Hoare triple {3831#false} assume true; {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L273 TraceCheckUtils]: 88: Hoare triple {3831#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {3831#false} is VALID [2018-11-14 16:54:14,515 INFO L256 TraceCheckUtils]: 89: Hoare triple {3831#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {3831#false} is VALID [2018-11-14 16:54:14,516 INFO L273 TraceCheckUtils]: 90: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2018-11-14 16:54:14,516 INFO L273 TraceCheckUtils]: 91: Hoare triple {3831#false} assume ~cond == 0; {3831#false} is VALID [2018-11-14 16:54:14,516 INFO L273 TraceCheckUtils]: 92: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2018-11-14 16:54:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:14,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:14,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:54:14,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-14 16:54:14,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:14,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:54:14,601 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-14 16:54:14,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:54:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:54:14,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:54:14,602 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 10 states. [2018-11-14 16:54:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:14,931 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-14 16:54:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:54:14,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-14 16:54:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:54:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2018-11-14 16:54:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:54:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2018-11-14 16:54:14,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 96 transitions. [2018-11-14 16:54:15,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:15,611 INFO L225 Difference]: With dead ends: 174 [2018-11-14 16:54:15,612 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 16:54:15,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:54:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 16:54:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-14 16:54:15,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:15,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 101 states. [2018-11-14 16:54:15,643 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 101 states. [2018-11-14 16:54:15,643 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 101 states. [2018-11-14 16:54:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:15,647 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 16:54:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 16:54:15,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:15,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:15,648 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 102 states. [2018-11-14 16:54:15,648 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 102 states. [2018-11-14 16:54:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:15,651 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 16:54:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 16:54:15,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:15,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:15,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:15,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 16:54:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-14 16:54:15,655 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 93 [2018-11-14 16:54:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:15,655 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-14 16:54:15,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:54:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 16:54:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 16:54:15,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:15,657 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 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] [2018-11-14 16:54:15,657 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1111564178, now seen corresponding path program 7 times [2018-11-14 16:54:15,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:15,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:16,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2018-11-14 16:54:16,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {4690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4690#true} is VALID [2018-11-14 16:54:16,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {4690#true} assume true; {4690#true} is VALID [2018-11-14 16:54:16,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4690#true} {4690#true} #111#return; {4690#true} is VALID [2018-11-14 16:54:16,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {4690#true} call #t~ret13 := main(); {4690#true} is VALID [2018-11-14 16:54:16,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {4690#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);havoc ~a~0;~a~0 := 0; {4692#(= main_~a~0 0)} is VALID [2018-11-14 16:54:16,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {4692#(= main_~a~0 0)} assume true; {4692#(= main_~a~0 0)} is VALID [2018-11-14 16:54:16,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {4692#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4692#(= main_~a~0 0)} is VALID [2018-11-14 16:54:16,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {4692#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {4693#(<= main_~a~0 1)} assume true; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {4693#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {4694#(<= main_~a~0 2)} assume true; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {4694#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {4695#(<= main_~a~0 3)} assume true; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {4695#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {4695#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {4696#(<= main_~a~0 4)} assume true; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {4696#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {4696#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {4697#(<= main_~a~0 5)} assume true; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {4697#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {4697#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {4698#(<= main_~a~0 6)} assume true; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {4698#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {4698#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:16,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {4699#(<= main_~a~0 7)} assume true; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {4699#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {4691#false} havoc ~i~0;~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 30: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 31: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 43: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 51: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 52: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 55: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 56: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 57: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,327 INFO L273 TraceCheckUtils]: 58: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 59: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 60: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 61: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 62: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 63: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 64: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,328 INFO L273 TraceCheckUtils]: 66: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 67: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 68: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 69: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 70: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 72: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 77: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 78: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 81: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 82: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,330 INFO L273 TraceCheckUtils]: 83: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 84: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 85: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 86: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 87: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 88: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 89: Hoare triple {4691#false} havoc ~x~0;~x~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 90: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,331 INFO L273 TraceCheckUtils]: 91: Hoare triple {4691#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {4691#false} is VALID [2018-11-14 16:54:16,332 INFO L256 TraceCheckUtils]: 92: Hoare triple {4691#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4691#false} is VALID [2018-11-14 16:54:16,332 INFO L273 TraceCheckUtils]: 93: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2018-11-14 16:54:16,332 INFO L273 TraceCheckUtils]: 94: Hoare triple {4691#false} assume ~cond == 0; {4691#false} is VALID [2018-11-14 16:54:16,332 INFO L273 TraceCheckUtils]: 95: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2018-11-14 16:54:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:16,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:16,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:16,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2018-11-14 16:54:16,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {4690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4690#true} is VALID [2018-11-14 16:54:16,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {4690#true} assume true; {4690#true} is VALID [2018-11-14 16:54:16,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4690#true} {4690#true} #111#return; {4690#true} is VALID [2018-11-14 16:54:16,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {4690#true} call #t~ret13 := main(); {4690#true} is VALID [2018-11-14 16:54:16,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {4690#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);havoc ~a~0;~a~0 := 0; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:16,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {4718#(<= main_~a~0 0)} assume true; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:16,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {4718#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4718#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:16,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {4718#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {4693#(<= main_~a~0 1)} assume true; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4693#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:16,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {4693#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {4694#(<= main_~a~0 2)} assume true; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4694#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:16,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {4694#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {4695#(<= main_~a~0 3)} assume true; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {4695#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4695#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:16,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {4695#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {4696#(<= main_~a~0 4)} assume true; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {4696#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4696#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:16,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {4696#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {4697#(<= main_~a~0 5)} assume true; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {4697#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4697#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:16,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {4697#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {4698#(<= main_~a~0 6)} assume true; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {4698#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {4698#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:16,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {4698#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:16,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {4699#(<= main_~a~0 7)} assume true; {4699#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:16,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {4699#(<= main_~a~0 7)} assume !(~a~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {4691#false} havoc ~i~0;~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 37: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {4691#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 49: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 50: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 51: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 52: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {4691#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4691#false} is VALID [2018-11-14 16:54:16,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,573 INFO L273 TraceCheckUtils]: 65: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 66: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 67: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {4691#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 73: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,574 INFO L273 TraceCheckUtils]: 74: Hoare triple {4691#false} ~i~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 75: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 76: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 77: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 83: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 85: Hoare triple {4691#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 86: Hoare triple {4691#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 87: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 88: Hoare triple {4691#false} assume !(~i~0 < 100000); {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 89: Hoare triple {4691#false} havoc ~x~0;~x~0 := 0; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {4691#false} assume true; {4691#false} is VALID [2018-11-14 16:54:16,576 INFO L273 TraceCheckUtils]: 91: Hoare triple {4691#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {4691#false} is VALID [2018-11-14 16:54:16,577 INFO L256 TraceCheckUtils]: 92: Hoare triple {4691#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {4691#false} is VALID [2018-11-14 16:54:16,577 INFO L273 TraceCheckUtils]: 93: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2018-11-14 16:54:16,577 INFO L273 TraceCheckUtils]: 94: Hoare triple {4691#false} assume ~cond == 0; {4691#false} is VALID [2018-11-14 16:54:16,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2018-11-14 16:54:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:16,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:16,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:54:16,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-14 16:54:16,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:16,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:54:16,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:16,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:54:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:54:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:16,663 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 11 states. [2018-11-14 16:54:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:17,056 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-11-14 16:54:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:54:17,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-14 16:54:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-14 16:54:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-14 16:54:17,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-14 16:54:17,159 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-14 16:54:17,163 INFO L225 Difference]: With dead ends: 177 [2018-11-14 16:54:17,163 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 16:54:17,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 16:54:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-14 16:54:17,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:17,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-14 16:54:17,205 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-14 16:54:17,206 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-14 16:54:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:17,208 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-14 16:54:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-14 16:54:17,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:17,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:17,209 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-14 16:54:17,210 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-14 16:54:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:17,212 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-14 16:54:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-14 16:54:17,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:17,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:17,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:17,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:54:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-11-14 16:54:17,215 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 96 [2018-11-14 16:54:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:17,216 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-11-14 16:54:17,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:54:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-11-14 16:54:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 16:54:17,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:17,217 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 5, 5, 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] [2018-11-14 16:54:17,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:17,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1104849457, now seen corresponding path program 8 times [2018-11-14 16:54:17,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:17,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:17,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:17,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2018-11-14 16:54:17,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {5574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5574#true} is VALID [2018-11-14 16:54:17,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {5574#true} assume true; {5574#true} is VALID [2018-11-14 16:54:17,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} #111#return; {5574#true} is VALID [2018-11-14 16:54:17,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {5574#true} call #t~ret13 := main(); {5574#true} is VALID [2018-11-14 16:54:17,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {5574#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);havoc ~a~0;~a~0 := 0; {5576#(= main_~a~0 0)} is VALID [2018-11-14 16:54:17,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {5576#(= main_~a~0 0)} assume true; {5576#(= main_~a~0 0)} is VALID [2018-11-14 16:54:17,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {5576#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5576#(= main_~a~0 0)} is VALID [2018-11-14 16:54:17,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {5576#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {5577#(<= main_~a~0 1)} assume true; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {5577#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~a~0 2)} assume true; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {5578#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {5579#(<= main_~a~0 3)} assume true; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {5579#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {5579#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {5580#(<= main_~a~0 4)} assume true; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {5580#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {5580#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {5581#(<= main_~a~0 5)} assume true; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {5581#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {5581#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {5582#(<= main_~a~0 6)} assume true; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {5582#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {5582#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {5583#(<= main_~a~0 7)} assume true; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {5583#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {5583#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:17,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {5584#(<= main_~a~0 8)} assume true; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:17,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {5584#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {5575#false} havoc ~i~0;~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,524 INFO L273 TraceCheckUtils]: 42: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 77: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 81: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 82: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 87: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 88: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 89: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {5575#false} havoc ~x~0;~x~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 94: Hoare triple {5575#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L256 TraceCheckUtils]: 95: Hoare triple {5575#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 96: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 97: Hoare triple {5575#false} assume ~cond == 0; {5575#false} is VALID [2018-11-14 16:54:17,532 INFO L273 TraceCheckUtils]: 98: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2018-11-14 16:54:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:17,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:17,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:17,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:17,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:17,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:17,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:17,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2018-11-14 16:54:17,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {5574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5574#true} is VALID [2018-11-14 16:54:17,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {5574#true} assume true; {5574#true} is VALID [2018-11-14 16:54:17,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} #111#return; {5574#true} is VALID [2018-11-14 16:54:17,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {5574#true} call #t~ret13 := main(); {5574#true} is VALID [2018-11-14 16:54:17,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {5574#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);havoc ~a~0;~a~0 := 0; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:17,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {5603#(<= main_~a~0 0)} assume true; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:17,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {5603#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5603#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:17,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {5603#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {5577#(<= main_~a~0 1)} assume true; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {5577#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5577#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:17,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~a~0 2)} assume true; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {5578#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5578#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:17,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {5579#(<= main_~a~0 3)} assume true; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {5579#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5579#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:17,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {5579#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {5580#(<= main_~a~0 4)} assume true; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {5580#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5580#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:17,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {5580#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {5581#(<= main_~a~0 5)} assume true; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {5581#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5581#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:17,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {5581#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {5582#(<= main_~a~0 6)} assume true; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {5582#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5582#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:17,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {5582#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {5583#(<= main_~a~0 7)} assume true; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {5583#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {5583#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:17,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {5583#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:17,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {5584#(<= main_~a~0 8)} assume true; {5584#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:17,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {5584#(<= main_~a~0 8)} assume !(~a~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {5575#false} havoc ~i~0;~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {5575#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {5575#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5575#false} is VALID [2018-11-14 16:54:17,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 61: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 62: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {5575#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {5575#false} ~i~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 84: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,810 INFO L273 TraceCheckUtils]: 85: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 86: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 87: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {5575#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {5575#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 90: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 91: Hoare triple {5575#false} assume !(~i~0 < 100000); {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 92: Hoare triple {5575#false} havoc ~x~0;~x~0 := 0; {5575#false} is VALID [2018-11-14 16:54:17,811 INFO L273 TraceCheckUtils]: 93: Hoare triple {5575#false} assume true; {5575#false} is VALID [2018-11-14 16:54:17,812 INFO L273 TraceCheckUtils]: 94: Hoare triple {5575#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {5575#false} is VALID [2018-11-14 16:54:17,812 INFO L256 TraceCheckUtils]: 95: Hoare triple {5575#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {5575#false} is VALID [2018-11-14 16:54:17,812 INFO L273 TraceCheckUtils]: 96: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2018-11-14 16:54:17,812 INFO L273 TraceCheckUtils]: 97: Hoare triple {5575#false} assume ~cond == 0; {5575#false} is VALID [2018-11-14 16:54:17,812 INFO L273 TraceCheckUtils]: 98: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2018-11-14 16:54:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:17,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:54:17,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-14 16:54:17,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:17,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:54:17,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:17,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:54:17,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:54:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:17,901 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 12 states. [2018-11-14 16:54:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:18,054 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2018-11-14 16:54:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:54:18,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-11-14 16:54:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 16:54:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 16:54:18,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2018-11-14 16:54:18,145 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-14 16:54:18,147 INFO L225 Difference]: With dead ends: 180 [2018-11-14 16:54:18,147 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 16:54:18,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 16:54:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-14 16:54:18,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:18,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-14 16:54:18,182 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-14 16:54:18,182 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-14 16:54:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:18,184 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-14 16:54:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-11-14 16:54:18,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:18,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:18,184 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-14 16:54:18,185 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-14 16:54:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:18,186 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-11-14 16:54:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-11-14 16:54:18,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:18,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:18,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:18,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 16:54:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-14 16:54:18,189 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 99 [2018-11-14 16:54:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:18,190 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-14 16:54:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:54:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-14 16:54:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 16:54:18,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:18,191 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 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] [2018-11-14 16:54:18,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:18,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1364908238, now seen corresponding path program 9 times [2018-11-14 16:54:18,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:18,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:18,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {6482#true} call ULTIMATE.init(); {6482#true} is VALID [2018-11-14 16:54:18,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {6482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6482#true} is VALID [2018-11-14 16:54:18,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6482#true} {6482#true} #111#return; {6482#true} is VALID [2018-11-14 16:54:18,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {6482#true} call #t~ret13 := main(); {6482#true} is VALID [2018-11-14 16:54:18,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {6482#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);havoc ~a~0;~a~0 := 0; {6484#(= main_~a~0 0)} is VALID [2018-11-14 16:54:18,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {6484#(= main_~a~0 0)} assume true; {6484#(= main_~a~0 0)} is VALID [2018-11-14 16:54:18,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {6484#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6484#(= main_~a~0 0)} is VALID [2018-11-14 16:54:18,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {6484#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:18,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {6485#(<= main_~a~0 1)} assume true; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:18,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {6485#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6485#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:18,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {6485#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:18,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {6486#(<= main_~a~0 2)} assume true; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:18,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {6486#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6486#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:18,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {6486#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:18,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {6487#(<= main_~a~0 3)} assume true; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:18,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {6487#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6487#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:18,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {6487#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:18,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {6488#(<= main_~a~0 4)} assume true; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:18,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {6488#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6488#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:18,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {6488#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:18,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {6489#(<= main_~a~0 5)} assume true; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:18,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {6489#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6489#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:18,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {6489#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:18,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {6490#(<= main_~a~0 6)} assume true; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:18,584 INFO L273 TraceCheckUtils]: 25: Hoare triple {6490#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6490#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:18,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {6490#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:18,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {6491#(<= main_~a~0 7)} assume true; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:18,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {6491#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6491#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:18,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {6491#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:18,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {6492#(<= main_~a~0 8)} assume true; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:18,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {6492#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6492#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:18,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {6492#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6493#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:18,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {6493#(<= main_~a~0 9)} assume true; {6493#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:18,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {6493#(<= main_~a~0 9)} assume !(~a~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {6483#false} havoc ~i~0;~i~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 16:54:18,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 16:54:18,591 INFO L273 TraceCheckUtils]: 39: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 16:54:18,591 INFO L273 TraceCheckUtils]: 41: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 16:54:18,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,591 INFO L273 TraceCheckUtils]: 43: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 47: Hoare triple {6483#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 48: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 49: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,592 INFO L273 TraceCheckUtils]: 50: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 57: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 62: Hoare triple {6483#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 63: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 64: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 65: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,594 INFO L273 TraceCheckUtils]: 66: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 67: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 68: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 69: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 70: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 71: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 72: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 73: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 16:54:18,595 INFO L273 TraceCheckUtils]: 74: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 75: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 76: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 77: Hoare triple {6483#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 79: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 80: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 81: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 82: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,596 INFO L273 TraceCheckUtils]: 83: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 84: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 85: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 86: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 87: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 88: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 89: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,597 INFO L273 TraceCheckUtils]: 90: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,598 INFO L273 TraceCheckUtils]: 92: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,598 INFO L273 TraceCheckUtils]: 93: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,598 INFO L273 TraceCheckUtils]: 94: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,598 INFO L273 TraceCheckUtils]: 95: Hoare triple {6483#false} havoc ~x~0;~x~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L273 TraceCheckUtils]: 96: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L273 TraceCheckUtils]: 97: Hoare triple {6483#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L256 TraceCheckUtils]: 98: Hoare triple {6483#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L273 TraceCheckUtils]: 99: Hoare triple {6483#false} ~cond := #in~cond; {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L273 TraceCheckUtils]: 100: Hoare triple {6483#false} assume ~cond == 0; {6483#false} is VALID [2018-11-14 16:54:18,599 INFO L273 TraceCheckUtils]: 101: Hoare triple {6483#false} assume !false; {6483#false} is VALID [2018-11-14 16:54:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 16:54:18,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:18,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:18,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:54:18,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:18,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:18,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {6482#true} call ULTIMATE.init(); {6482#true} is VALID [2018-11-14 16:54:18,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {6482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6482#true} is VALID [2018-11-14 16:54:18,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6482#true} {6482#true} #111#return; {6482#true} is VALID [2018-11-14 16:54:18,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {6482#true} call #t~ret13 := main(); {6482#true} is VALID [2018-11-14 16:54:18,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {6482#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);havoc ~a~0;~a~0 := 0; {6482#true} is VALID [2018-11-14 16:54:18,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {6482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {6482#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {6482#true} assume !(~a~0 < 100000); {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {6482#true} havoc ~i~0;~i~0 := 0; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 36: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 16:54:18,970 INFO L273 TraceCheckUtils]: 45: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {6482#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {6482#true} assume !(~i~0 < 100000); {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 50: Hoare triple {6482#true} ~i~0 := 0; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 51: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,971 INFO L273 TraceCheckUtils]: 52: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,972 INFO L273 TraceCheckUtils]: 61: Hoare triple {6482#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6482#true} is VALID [2018-11-14 16:54:18,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {6482#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6482#true} is VALID [2018-11-14 16:54:18,973 INFO L273 TraceCheckUtils]: 63: Hoare triple {6482#true} assume true; {6482#true} is VALID [2018-11-14 16:54:18,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {6482#true} assume !(~i~0 < 100000); {6482#true} is VALID [2018-11-14 16:54:18,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {6482#true} ~i~0 := 0; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:18,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {6692#(<= main_~i~0 0)} assume true; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:18,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {6692#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6692#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:18,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {6692#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:18,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {6702#(<= main_~i~0 1)} assume true; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:18,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {6702#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6702#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:18,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {6702#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:18,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {6712#(<= main_~i~0 2)} assume true; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:18,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {6712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6712#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:18,977 INFO L273 TraceCheckUtils]: 74: Hoare triple {6712#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:18,978 INFO L273 TraceCheckUtils]: 75: Hoare triple {6722#(<= main_~i~0 3)} assume true; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:18,978 INFO L273 TraceCheckUtils]: 76: Hoare triple {6722#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6722#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:18,979 INFO L273 TraceCheckUtils]: 77: Hoare triple {6722#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6732#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:18,980 INFO L273 TraceCheckUtils]: 78: Hoare triple {6732#(<= main_~i~0 4)} assume true; {6732#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:18,980 INFO L273 TraceCheckUtils]: 79: Hoare triple {6732#(<= main_~i~0 4)} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,981 INFO L273 TraceCheckUtils]: 80: Hoare triple {6483#false} ~i~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,981 INFO L273 TraceCheckUtils]: 81: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,981 INFO L273 TraceCheckUtils]: 82: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,981 INFO L273 TraceCheckUtils]: 83: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,981 INFO L273 TraceCheckUtils]: 84: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,982 INFO L273 TraceCheckUtils]: 85: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,982 INFO L273 TraceCheckUtils]: 86: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,982 INFO L273 TraceCheckUtils]: 87: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,982 INFO L273 TraceCheckUtils]: 88: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,982 INFO L273 TraceCheckUtils]: 89: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 90: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 91: Hoare triple {6483#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 92: Hoare triple {6483#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 93: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 94: Hoare triple {6483#false} assume !(~i~0 < 100000); {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 95: Hoare triple {6483#false} havoc ~x~0;~x~0 := 0; {6483#false} is VALID [2018-11-14 16:54:18,983 INFO L273 TraceCheckUtils]: 96: Hoare triple {6483#false} assume true; {6483#false} is VALID [2018-11-14 16:54:18,984 INFO L273 TraceCheckUtils]: 97: Hoare triple {6483#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {6483#false} is VALID [2018-11-14 16:54:18,984 INFO L256 TraceCheckUtils]: 98: Hoare triple {6483#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {6483#false} is VALID [2018-11-14 16:54:18,984 INFO L273 TraceCheckUtils]: 99: Hoare triple {6483#false} ~cond := #in~cond; {6483#false} is VALID [2018-11-14 16:54:18,984 INFO L273 TraceCheckUtils]: 100: Hoare triple {6483#false} assume ~cond == 0; {6483#false} is VALID [2018-11-14 16:54:18,984 INFO L273 TraceCheckUtils]: 101: Hoare triple {6483#false} assume !false; {6483#false} is VALID [2018-11-14 16:54:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-14 16:54:19,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:19,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-14 16:54:19,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-11-14 16:54:19,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:19,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:54:19,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:19,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:54:19,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:54:19,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:54:19,114 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 17 states. [2018-11-14 16:54:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:20,214 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-11-14 16:54:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:54:20,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-11-14 16:54:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:54:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2018-11-14 16:54:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:54:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2018-11-14 16:54:20,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 169 transitions. [2018-11-14 16:54:20,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:20,812 INFO L225 Difference]: With dead ends: 199 [2018-11-14 16:54:20,812 INFO L226 Difference]: Without dead ends: 127 [2018-11-14 16:54:20,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:54:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-14 16:54:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-11-14 16:54:20,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:20,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 122 states. [2018-11-14 16:54:20,904 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 122 states. [2018-11-14 16:54:20,904 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 122 states. [2018-11-14 16:54:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:20,907 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-14 16:54:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-11-14 16:54:20,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:20,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:20,908 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 127 states. [2018-11-14 16:54:20,908 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 127 states. [2018-11-14 16:54:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:20,911 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-14 16:54:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-11-14 16:54:20,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:20,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:20,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:20,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:54:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-11-14 16:54:20,914 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 102 [2018-11-14 16:54:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:20,915 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-11-14 16:54:20,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:54:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-14 16:54:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:54:20,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:20,916 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 6, 6, 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] [2018-11-14 16:54:20,916 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:20,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 387033355, now seen corresponding path program 10 times [2018-11-14 16:54:20,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:20,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:21,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2018-11-14 16:54:21,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7486#true} is VALID [2018-11-14 16:54:21,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2018-11-14 16:54:21,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #111#return; {7486#true} is VALID [2018-11-14 16:54:21,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret13 := main(); {7486#true} is VALID [2018-11-14 16:54:21,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {7486#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);havoc ~a~0;~a~0 := 0; {7488#(= main_~a~0 0)} is VALID [2018-11-14 16:54:21,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {7488#(= main_~a~0 0)} assume true; {7488#(= main_~a~0 0)} is VALID [2018-11-14 16:54:21,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {7488#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7488#(= main_~a~0 0)} is VALID [2018-11-14 16:54:21,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {7488#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:21,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {7489#(<= main_~a~0 1)} assume true; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:21,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {7489#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:21,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {7489#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:21,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {7490#(<= main_~a~0 2)} assume true; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:21,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {7490#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:21,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {7490#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:21,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {7491#(<= main_~a~0 3)} assume true; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:21,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {7491#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:21,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:21,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {7492#(<= main_~a~0 4)} assume true; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:21,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {7492#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:21,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {7492#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:21,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {7493#(<= main_~a~0 5)} assume true; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:21,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {7493#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:21,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {7493#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:21,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {7494#(<= main_~a~0 6)} assume true; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:21,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {7494#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:21,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {7494#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:21,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {7495#(<= main_~a~0 7)} assume true; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:21,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {7495#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:21,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {7495#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:21,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {7496#(<= main_~a~0 8)} assume true; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:21,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {7496#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:21,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {7496#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:21,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {7497#(<= main_~a~0 9)} assume true; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:21,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {7497#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:21,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {7497#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:21,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {7498#(<= main_~a~0 10)} assume true; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:21,939 INFO L273 TraceCheckUtils]: 37: Hoare triple {7498#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:21,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {7487#false} havoc ~i~0;~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:21,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,939 INFO L273 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:21,939 INFO L273 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:21,940 INFO L273 TraceCheckUtils]: 42: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,940 INFO L273 TraceCheckUtils]: 43: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:21,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:21,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 50: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 51: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 56: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:21,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 68: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 69: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 70: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:21,943 INFO L273 TraceCheckUtils]: 71: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 72: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 73: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 74: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 75: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 76: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 77: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:21,944 INFO L273 TraceCheckUtils]: 80: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 82: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 83: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 84: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 85: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 86: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 87: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,945 INFO L273 TraceCheckUtils]: 88: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 89: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 90: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 91: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 92: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 93: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 94: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 95: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:21,946 INFO L273 TraceCheckUtils]: 96: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 97: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 98: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 99: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 100: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 102: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 103: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 104: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:21,947 INFO L273 TraceCheckUtils]: 105: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 106: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 107: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 108: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 109: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 110: Hoare triple {7487#false} havoc ~x~0;~x~0 := 0; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 111: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L273 TraceCheckUtils]: 112: Hoare triple {7487#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {7487#false} is VALID [2018-11-14 16:54:21,948 INFO L256 TraceCheckUtils]: 113: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7487#false} is VALID [2018-11-14 16:54:21,949 INFO L273 TraceCheckUtils]: 114: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2018-11-14 16:54:21,949 INFO L273 TraceCheckUtils]: 115: Hoare triple {7487#false} assume ~cond == 0; {7487#false} is VALID [2018-11-14 16:54:21,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2018-11-14 16:54:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:54:21,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:21,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:21,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:54:22,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:54:22,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:22,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:22,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {7486#true} call ULTIMATE.init(); {7486#true} is VALID [2018-11-14 16:54:22,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {7486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7486#true} is VALID [2018-11-14 16:54:22,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {7486#true} assume true; {7486#true} is VALID [2018-11-14 16:54:22,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} #111#return; {7486#true} is VALID [2018-11-14 16:54:22,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {7486#true} call #t~ret13 := main(); {7486#true} is VALID [2018-11-14 16:54:22,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {7486#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);havoc ~a~0;~a~0 := 0; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:22,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {7517#(<= main_~a~0 0)} assume true; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:22,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {7517#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7517#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:22,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {7517#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:22,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {7489#(<= main_~a~0 1)} assume true; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:22,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {7489#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7489#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:22,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {7489#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:22,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {7490#(<= main_~a~0 2)} assume true; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:22,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {7490#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7490#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:22,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {7490#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:22,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {7491#(<= main_~a~0 3)} assume true; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:22,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {7491#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7491#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:22,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:22,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {7492#(<= main_~a~0 4)} assume true; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:22,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {7492#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7492#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:22,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {7492#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:22,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {7493#(<= main_~a~0 5)} assume true; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:22,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {7493#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7493#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:22,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {7493#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:22,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {7494#(<= main_~a~0 6)} assume true; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:22,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {7494#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7494#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:22,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {7494#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:22,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {7495#(<= main_~a~0 7)} assume true; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:22,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {7495#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7495#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:22,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {7495#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:22,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {7496#(<= main_~a~0 8)} assume true; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:22,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {7496#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7496#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:22,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {7496#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:22,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {7497#(<= main_~a~0 9)} assume true; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:22,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {7497#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {7497#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:22,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {7497#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:22,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {7498#(<= main_~a~0 10)} assume true; {7498#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:22,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {7498#(<= main_~a~0 10)} assume !(~a~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:22,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {7487#false} havoc ~i~0;~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:22,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:22,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:22,220 INFO L273 TraceCheckUtils]: 42: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:22,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:22,221 INFO L273 TraceCheckUtils]: 45: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,221 INFO L273 TraceCheckUtils]: 46: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:22,221 INFO L273 TraceCheckUtils]: 47: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:22,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 49: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 50: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 51: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {7487#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 54: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,222 INFO L273 TraceCheckUtils]: 55: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 56: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 57: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 58: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 59: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 60: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 61: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:22,223 INFO L273 TraceCheckUtils]: 63: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 64: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 65: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 66: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 67: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 68: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 69: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 70: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 71: Hoare triple {7487#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7487#false} is VALID [2018-11-14 16:54:22,224 INFO L273 TraceCheckUtils]: 72: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 73: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 75: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 76: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 77: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 78: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 79: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:22,225 INFO L273 TraceCheckUtils]: 80: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 81: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 82: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 83: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 84: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 85: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 86: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 87: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7487#false} is VALID [2018-11-14 16:54:22,226 INFO L273 TraceCheckUtils]: 89: Hoare triple {7487#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 90: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 91: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 92: Hoare triple {7487#false} ~i~0 := 0; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 93: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 94: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 95: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 96: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,227 INFO L273 TraceCheckUtils]: 97: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 98: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 99: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 100: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 101: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 102: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 103: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 104: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 105: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,228 INFO L273 TraceCheckUtils]: 106: Hoare triple {7487#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 107: Hoare triple {7487#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 108: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 109: Hoare triple {7487#false} assume !(~i~0 < 100000); {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {7487#false} havoc ~x~0;~x~0 := 0; {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {7487#false} assume true; {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {7487#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L256 TraceCheckUtils]: 113: Hoare triple {7487#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {7487#false} is VALID [2018-11-14 16:54:22,229 INFO L273 TraceCheckUtils]: 114: Hoare triple {7487#false} ~cond := #in~cond; {7487#false} is VALID [2018-11-14 16:54:22,230 INFO L273 TraceCheckUtils]: 115: Hoare triple {7487#false} assume ~cond == 0; {7487#false} is VALID [2018-11-14 16:54:22,230 INFO L273 TraceCheckUtils]: 116: Hoare triple {7487#false} assume !false; {7487#false} is VALID [2018-11-14 16:54:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:54:22,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:22,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:54:22,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 16:54:22,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:22,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:54:22,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:22,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:54:22,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:54:22,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:54:22,319 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 14 states. [2018-11-14 16:54:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:23,268 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-11-14 16:54:23,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:54:23,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 16:54:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:54:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 16:54:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:54:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 16:54:23,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2018-11-14 16:54:23,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:23,694 INFO L225 Difference]: With dead ends: 210 [2018-11-14 16:54:23,694 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 16:54:23,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:54:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 16:54:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 16:54:23,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:23,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 16:54:23,751 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 16:54:23,751 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 16:54:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:23,754 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-14 16:54:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-11-14 16:54:23,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:23,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:23,755 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 16:54:23,755 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 16:54:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:23,758 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-14 16:54:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-11-14 16:54:23,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:23,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:23,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:23,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 16:54:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-11-14 16:54:23,761 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 117 [2018-11-14 16:54:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:23,761 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-11-14 16:54:23,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:54:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-11-14 16:54:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 16:54:23,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:23,763 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 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] [2018-11-14 16:54:23,763 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:23,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1530837044, now seen corresponding path program 11 times [2018-11-14 16:54:23,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:23,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:24,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {8550#true} call ULTIMATE.init(); {8550#true} is VALID [2018-11-14 16:54:24,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {8550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8550#true} is VALID [2018-11-14 16:54:24,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 16:54:24,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8550#true} {8550#true} #111#return; {8550#true} is VALID [2018-11-14 16:54:24,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {8550#true} call #t~ret13 := main(); {8550#true} is VALID [2018-11-14 16:54:24,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {8550#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);havoc ~a~0;~a~0 := 0; {8552#(= main_~a~0 0)} is VALID [2018-11-14 16:54:24,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {8552#(= main_~a~0 0)} assume true; {8552#(= main_~a~0 0)} is VALID [2018-11-14 16:54:24,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {8552#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8552#(= main_~a~0 0)} is VALID [2018-11-14 16:54:24,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {8552#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:24,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {8553#(<= main_~a~0 1)} assume true; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:24,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {8553#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:24,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {8553#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:24,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {8554#(<= main_~a~0 2)} assume true; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:24,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {8554#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:24,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {8554#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:24,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {8555#(<= main_~a~0 3)} assume true; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:24,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {8555#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:24,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {8555#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:24,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {8556#(<= main_~a~0 4)} assume true; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:24,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {8556#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:24,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {8556#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:24,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#(<= main_~a~0 5)} assume true; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:24,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {8557#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:24,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {8557#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:24,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {8558#(<= main_~a~0 6)} assume true; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:24,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {8558#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:24,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {8558#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:24,947 INFO L273 TraceCheckUtils]: 27: Hoare triple {8559#(<= main_~a~0 7)} assume true; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:24,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {8559#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:24,948 INFO L273 TraceCheckUtils]: 29: Hoare triple {8559#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:24,949 INFO L273 TraceCheckUtils]: 30: Hoare triple {8560#(<= main_~a~0 8)} assume true; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:24,949 INFO L273 TraceCheckUtils]: 31: Hoare triple {8560#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:24,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {8560#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:24,951 INFO L273 TraceCheckUtils]: 33: Hoare triple {8561#(<= main_~a~0 9)} assume true; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:24,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {8561#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:24,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {8561#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:24,952 INFO L273 TraceCheckUtils]: 36: Hoare triple {8562#(<= main_~a~0 10)} assume true; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:24,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {8562#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:24,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {8562#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:24,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {8563#(<= main_~a~0 11)} assume true; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:24,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {8563#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:24,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {8551#false} havoc ~i~0;~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:24,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:24,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:24,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:24,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:24,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:24,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:24,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,958 INFO L273 TraceCheckUtils]: 52: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:24,958 INFO L273 TraceCheckUtils]: 53: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:24,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:24,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 58: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 60: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 61: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:24,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 64: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 65: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 66: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 67: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 70: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:24,960 INFO L273 TraceCheckUtils]: 71: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 72: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 73: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 74: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 75: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 76: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 77: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 80: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 81: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 82: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 83: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 84: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 86: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:24,962 INFO L273 TraceCheckUtils]: 87: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 88: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 89: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 90: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 91: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 92: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 93: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 94: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 95: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:24,963 INFO L273 TraceCheckUtils]: 96: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 97: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 98: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 99: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 100: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 101: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 102: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 103: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:24,964 INFO L273 TraceCheckUtils]: 104: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 105: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 106: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 107: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 108: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 109: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 110: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 111: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 112: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:24,965 INFO L273 TraceCheckUtils]: 113: Hoare triple {8551#false} havoc ~x~0;~x~0 := 0; {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L273 TraceCheckUtils]: 114: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L273 TraceCheckUtils]: 115: Hoare triple {8551#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L256 TraceCheckUtils]: 116: Hoare triple {8551#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L273 TraceCheckUtils]: 117: Hoare triple {8551#false} ~cond := #in~cond; {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L273 TraceCheckUtils]: 118: Hoare triple {8551#false} assume ~cond == 0; {8551#false} is VALID [2018-11-14 16:54:24,966 INFO L273 TraceCheckUtils]: 119: Hoare triple {8551#false} assume !false; {8551#false} is VALID [2018-11-14 16:54:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:54:24,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:24,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:24,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:54:43,382 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:54:43,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:43,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:43,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {8550#true} call ULTIMATE.init(); {8550#true} is VALID [2018-11-14 16:54:43,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {8550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8550#true} is VALID [2018-11-14 16:54:43,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {8550#true} assume true; {8550#true} is VALID [2018-11-14 16:54:43,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8550#true} {8550#true} #111#return; {8550#true} is VALID [2018-11-14 16:54:43,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {8550#true} call #t~ret13 := main(); {8550#true} is VALID [2018-11-14 16:54:43,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {8550#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);havoc ~a~0;~a~0 := 0; {8582#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:43,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {8582#(<= main_~a~0 0)} assume true; {8582#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:43,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {8582#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8582#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:43,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {8582#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:43,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {8553#(<= main_~a~0 1)} assume true; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:43,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {8553#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8553#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:43,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {8553#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:43,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {8554#(<= main_~a~0 2)} assume true; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:43,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {8554#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8554#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:43,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {8554#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:43,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {8555#(<= main_~a~0 3)} assume true; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:43,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {8555#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8555#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:43,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {8555#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:43,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {8556#(<= main_~a~0 4)} assume true; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:43,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {8556#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8556#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:43,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {8556#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:43,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {8557#(<= main_~a~0 5)} assume true; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:43,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {8557#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8557#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:43,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {8557#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:43,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {8558#(<= main_~a~0 6)} assume true; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:43,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {8558#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8558#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:43,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {8558#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:43,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {8559#(<= main_~a~0 7)} assume true; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:43,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {8559#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8559#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:43,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {8559#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:43,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {8560#(<= main_~a~0 8)} assume true; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:43,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {8560#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8560#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:43,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {8560#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:43,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {8561#(<= main_~a~0 9)} assume true; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:43,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {8561#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8561#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:43,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {8561#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:43,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {8562#(<= main_~a~0 10)} assume true; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:43,689 INFO L273 TraceCheckUtils]: 37: Hoare triple {8562#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {8562#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:43,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {8562#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:43,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {8563#(<= main_~a~0 11)} assume true; {8563#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:43,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {8563#(<= main_~a~0 11)} assume !(~a~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:43,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {8551#false} havoc ~i~0;~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:43,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:43,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:43,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:43,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:43,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:43,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {8551#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 63: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 64: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 69: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 70: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 72: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,696 INFO L273 TraceCheckUtils]: 73: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 74: Hoare triple {8551#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 75: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 76: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 77: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 78: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 79: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:43,697 INFO L273 TraceCheckUtils]: 80: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 81: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 82: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 84: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 85: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 86: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:43,698 INFO L273 TraceCheckUtils]: 87: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 90: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 91: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 92: Hoare triple {8551#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 93: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,699 INFO L273 TraceCheckUtils]: 94: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 95: Hoare triple {8551#false} ~i~0 := 0; {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 96: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 97: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 98: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 101: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 102: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 103: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 104: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 105: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 106: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:43,701 INFO L273 TraceCheckUtils]: 107: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 108: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 109: Hoare triple {8551#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 110: Hoare triple {8551#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 111: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 112: Hoare triple {8551#false} assume !(~i~0 < 100000); {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 113: Hoare triple {8551#false} havoc ~x~0;~x~0 := 0; {8551#false} is VALID [2018-11-14 16:54:43,702 INFO L273 TraceCheckUtils]: 114: Hoare triple {8551#false} assume true; {8551#false} is VALID [2018-11-14 16:54:43,703 INFO L273 TraceCheckUtils]: 115: Hoare triple {8551#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {8551#false} is VALID [2018-11-14 16:54:43,703 INFO L256 TraceCheckUtils]: 116: Hoare triple {8551#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {8551#false} is VALID [2018-11-14 16:54:43,703 INFO L273 TraceCheckUtils]: 117: Hoare triple {8551#false} ~cond := #in~cond; {8551#false} is VALID [2018-11-14 16:54:43,703 INFO L273 TraceCheckUtils]: 118: Hoare triple {8551#false} assume ~cond == 0; {8551#false} is VALID [2018-11-14 16:54:43,703 INFO L273 TraceCheckUtils]: 119: Hoare triple {8551#false} assume !false; {8551#false} is VALID [2018-11-14 16:54:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:54:43,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:43,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:54:43,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 120 [2018-11-14 16:54:43,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:43,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:54:43,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:43,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:54:43,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:54:43,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:54:43,807 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 15 states. [2018-11-14 16:54:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:44,447 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-11-14 16:54:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:54:44,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 120 [2018-11-14 16:54:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:54:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2018-11-14 16:54:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:54:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2018-11-14 16:54:44,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 111 transitions. [2018-11-14 16:54:45,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:45,152 INFO L225 Difference]: With dead ends: 213 [2018-11-14 16:54:45,152 INFO L226 Difference]: Without dead ends: 129 [2018-11-14 16:54:45,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:54:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-14 16:54:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-14 16:54:45,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:45,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-14 16:54:45,200 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-14 16:54:45,200 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-14 16:54:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:45,203 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-11-14 16:54:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2018-11-14 16:54:45,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:45,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:45,204 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-14 16:54:45,205 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-14 16:54:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:45,208 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-11-14 16:54:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2018-11-14 16:54:45,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:45,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:45,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:45,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 16:54:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-11-14 16:54:45,212 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 120 [2018-11-14 16:54:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:45,213 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-11-14 16:54:45,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:54:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-11-14 16:54:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-14 16:54:45,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:45,214 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 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] [2018-11-14 16:54:45,215 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:45,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -857954965, now seen corresponding path program 12 times [2018-11-14 16:54:45,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:45,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:45,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:46,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {9638#true} call ULTIMATE.init(); {9638#true} is VALID [2018-11-14 16:54:46,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {9638#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9638#true} is VALID [2018-11-14 16:54:46,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:46,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9638#true} {9638#true} #111#return; {9638#true} is VALID [2018-11-14 16:54:46,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {9638#true} call #t~ret13 := main(); {9638#true} is VALID [2018-11-14 16:54:46,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {9638#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);havoc ~a~0;~a~0 := 0; {9640#(= main_~a~0 0)} is VALID [2018-11-14 16:54:46,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {9640#(= main_~a~0 0)} assume true; {9640#(= main_~a~0 0)} is VALID [2018-11-14 16:54:46,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {9640#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9640#(= main_~a~0 0)} is VALID [2018-11-14 16:54:46,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {9640#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9641#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:46,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {9641#(<= main_~a~0 1)} assume true; {9641#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:46,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {9641#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9641#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:46,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {9641#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9642#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:46,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {9642#(<= main_~a~0 2)} assume true; {9642#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:46,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {9642#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9642#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:46,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {9642#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9643#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:46,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {9643#(<= main_~a~0 3)} assume true; {9643#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:46,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {9643#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9643#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:46,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {9643#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9644#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:46,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {9644#(<= main_~a~0 4)} assume true; {9644#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:46,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {9644#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9644#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:46,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {9644#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9645#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:46,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {9645#(<= main_~a~0 5)} assume true; {9645#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:46,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {9645#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9645#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:46,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {9645#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9646#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:46,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {9646#(<= main_~a~0 6)} assume true; {9646#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:46,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {9646#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9646#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:46,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {9646#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9647#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:46,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {9647#(<= main_~a~0 7)} assume true; {9647#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:46,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {9647#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9647#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:46,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {9647#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9648#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:46,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {9648#(<= main_~a~0 8)} assume true; {9648#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:46,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {9648#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9648#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:46,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {9648#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9649#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:46,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {9649#(<= main_~a~0 9)} assume true; {9649#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:46,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {9649#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9649#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:46,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {9649#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9650#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:46,589 INFO L273 TraceCheckUtils]: 36: Hoare triple {9650#(<= main_~a~0 10)} assume true; {9650#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:46,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {9650#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9650#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:46,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {9650#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9651#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:46,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {9651#(<= main_~a~0 11)} assume true; {9651#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:46,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {9651#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9651#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:46,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {9651#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9652#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:46,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {9652#(<= main_~a~0 12)} assume true; {9652#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {9652#(<= main_~a~0 12)} assume !(~a~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {9639#false} havoc ~i~0;~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 45: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 46: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {9639#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9639#false} is VALID [2018-11-14 16:54:46,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {9639#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9639#false} is VALID [2018-11-14 16:54:46,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,602 INFO L273 TraceCheckUtils]: 52: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9639#false} is VALID [2018-11-14 16:54:46,602 INFO L273 TraceCheckUtils]: 53: Hoare triple {9639#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9639#false} is VALID [2018-11-14 16:54:46,602 INFO L273 TraceCheckUtils]: 54: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 55: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 56: Hoare triple {9639#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 57: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 58: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 59: Hoare triple {9639#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9639#false} is VALID [2018-11-14 16:54:46,603 INFO L273 TraceCheckUtils]: 60: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 61: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {9639#false} ~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 63: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 64: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 65: Hoare triple {9639#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 66: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 67: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 68: Hoare triple {9639#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9639#false} is VALID [2018-11-14 16:54:46,604 INFO L273 TraceCheckUtils]: 69: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 70: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 71: Hoare triple {9639#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 72: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 73: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 74: Hoare triple {9639#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 75: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 76: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9639#false} is VALID [2018-11-14 16:54:46,605 INFO L273 TraceCheckUtils]: 77: Hoare triple {9639#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 78: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 79: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 80: Hoare triple {9639#false} ~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 81: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 82: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 83: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 84: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,606 INFO L273 TraceCheckUtils]: 85: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 86: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 87: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 88: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 89: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 90: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 91: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 92: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 93: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,607 INFO L273 TraceCheckUtils]: 94: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 97: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 98: Hoare triple {9639#false} ~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 99: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 100: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 101: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:46,608 INFO L273 TraceCheckUtils]: 102: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 103: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 104: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 105: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 106: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 107: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 108: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 109: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 110: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:46,609 INFO L273 TraceCheckUtils]: 111: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 112: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 113: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 114: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 115: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 116: Hoare triple {9639#false} havoc ~x~0;~x~0 := 0; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 117: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L273 TraceCheckUtils]: 118: Hoare triple {9639#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {9639#false} is VALID [2018-11-14 16:54:46,610 INFO L256 TraceCheckUtils]: 119: Hoare triple {9639#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9639#false} is VALID [2018-11-14 16:54:46,611 INFO L273 TraceCheckUtils]: 120: Hoare triple {9639#false} ~cond := #in~cond; {9639#false} is VALID [2018-11-14 16:54:46,611 INFO L273 TraceCheckUtils]: 121: Hoare triple {9639#false} assume ~cond == 0; {9639#false} is VALID [2018-11-14 16:54:46,611 INFO L273 TraceCheckUtils]: 122: Hoare triple {9639#false} assume !false; {9639#false} is VALID [2018-11-14 16:54:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 16:54:46,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:46,618 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-14 16:54:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:54:50,735 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 16:54:50,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:50,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:51,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {9638#true} call ULTIMATE.init(); {9638#true} is VALID [2018-11-14 16:54:51,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {9638#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9638#true} is VALID [2018-11-14 16:54:51,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9638#true} {9638#true} #111#return; {9638#true} is VALID [2018-11-14 16:54:51,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {9638#true} call #t~ret13 := main(); {9638#true} is VALID [2018-11-14 16:54:51,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {9638#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);havoc ~a~0;~a~0 := 0; {9638#true} is VALID [2018-11-14 16:54:51,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,008 INFO L273 TraceCheckUtils]: 32: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {9638#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {9638#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {9638#true} assume !(~a~0 < 100000); {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 44: Hoare triple {9638#true} havoc ~i~0;~i~0 := 0; {9638#true} is VALID [2018-11-14 16:54:51,010 INFO L273 TraceCheckUtils]: 45: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,011 INFO L273 TraceCheckUtils]: 46: Hoare triple {9638#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9638#true} is VALID [2018-11-14 16:54:51,011 INFO L273 TraceCheckUtils]: 47: Hoare triple {9638#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9638#true} is VALID [2018-11-14 16:54:51,011 INFO L273 TraceCheckUtils]: 48: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,011 INFO L273 TraceCheckUtils]: 49: Hoare triple {9638#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9638#true} is VALID [2018-11-14 16:54:51,011 INFO L273 TraceCheckUtils]: 50: Hoare triple {9638#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {9638#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {9638#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {9638#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9638#true} is VALID [2018-11-14 16:54:51,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {9638#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9638#true} is VALID [2018-11-14 16:54:51,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {9638#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {9638#true} is VALID [2018-11-14 16:54:51,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {9638#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9638#true} is VALID [2018-11-14 16:54:51,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {9638#true} assume true; {9638#true} is VALID [2018-11-14 16:54:51,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {9638#true} assume !(~i~0 < 100000); {9638#true} is VALID [2018-11-14 16:54:51,028 INFO L273 TraceCheckUtils]: 62: Hoare triple {9638#true} ~i~0 := 0; {9842#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:51,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {9842#(<= main_~i~0 0)} assume true; {9842#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:51,051 INFO L273 TraceCheckUtils]: 64: Hoare triple {9842#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9842#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:51,060 INFO L273 TraceCheckUtils]: 65: Hoare triple {9842#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9852#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:51,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {9852#(<= main_~i~0 1)} assume true; {9852#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:51,063 INFO L273 TraceCheckUtils]: 67: Hoare triple {9852#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9852#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:51,064 INFO L273 TraceCheckUtils]: 68: Hoare triple {9852#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9862#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:51,064 INFO L273 TraceCheckUtils]: 69: Hoare triple {9862#(<= main_~i~0 2)} assume true; {9862#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:51,064 INFO L273 TraceCheckUtils]: 70: Hoare triple {9862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9862#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:51,065 INFO L273 TraceCheckUtils]: 71: Hoare triple {9862#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9872#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:51,065 INFO L273 TraceCheckUtils]: 72: Hoare triple {9872#(<= main_~i~0 3)} assume true; {9872#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:51,065 INFO L273 TraceCheckUtils]: 73: Hoare triple {9872#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9872#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:51,069 INFO L273 TraceCheckUtils]: 74: Hoare triple {9872#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9882#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:51,069 INFO L273 TraceCheckUtils]: 75: Hoare triple {9882#(<= main_~i~0 4)} assume true; {9882#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:51,070 INFO L273 TraceCheckUtils]: 76: Hoare triple {9882#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9882#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:51,070 INFO L273 TraceCheckUtils]: 77: Hoare triple {9882#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9892#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:51,070 INFO L273 TraceCheckUtils]: 78: Hoare triple {9892#(<= main_~i~0 5)} assume true; {9892#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 79: Hoare triple {9892#(<= main_~i~0 5)} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 80: Hoare triple {9639#false} ~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 81: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 82: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 83: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:51,071 INFO L273 TraceCheckUtils]: 84: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 85: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 86: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 87: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 88: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 89: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 90: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 91: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:51,072 INFO L273 TraceCheckUtils]: 92: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:51,073 INFO L273 TraceCheckUtils]: 93: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,073 INFO L273 TraceCheckUtils]: 94: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9639#false} is VALID [2018-11-14 16:54:51,073 INFO L273 TraceCheckUtils]: 95: Hoare triple {9639#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9639#false} is VALID [2018-11-14 16:54:51,073 INFO L273 TraceCheckUtils]: 96: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,073 INFO L273 TraceCheckUtils]: 97: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:51,074 INFO L273 TraceCheckUtils]: 98: Hoare triple {9639#false} ~i~0 := 0; {9639#false} is VALID [2018-11-14 16:54:51,074 INFO L273 TraceCheckUtils]: 99: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,074 INFO L273 TraceCheckUtils]: 100: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:51,074 INFO L273 TraceCheckUtils]: 101: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:51,074 INFO L273 TraceCheckUtils]: 102: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 103: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 104: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 105: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 106: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 107: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 108: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 109: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 110: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:51,075 INFO L273 TraceCheckUtils]: 111: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 112: Hoare triple {9639#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 113: Hoare triple {9639#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 114: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 115: Hoare triple {9639#false} assume !(~i~0 < 100000); {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 116: Hoare triple {9639#false} havoc ~x~0;~x~0 := 0; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {9639#false} assume true; {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L273 TraceCheckUtils]: 118: Hoare triple {9639#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {9639#false} is VALID [2018-11-14 16:54:51,076 INFO L256 TraceCheckUtils]: 119: Hoare triple {9639#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {9639#false} is VALID [2018-11-14 16:54:51,077 INFO L273 TraceCheckUtils]: 120: Hoare triple {9639#false} ~cond := #in~cond; {9639#false} is VALID [2018-11-14 16:54:51,077 INFO L273 TraceCheckUtils]: 121: Hoare triple {9639#false} assume ~cond == 0; {9639#false} is VALID [2018-11-14 16:54:51,077 INFO L273 TraceCheckUtils]: 122: Hoare triple {9639#false} assume !false; {9639#false} is VALID [2018-11-14 16:54:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 16:54:51,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:51,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-14 16:54:51,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 123 [2018-11-14 16:54:51,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:51,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:54:51,197 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-14 16:54:51,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:54:51,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:54:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:54:51,198 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 21 states. [2018-11-14 16:54:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:52,262 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-11-14 16:54:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:54:52,262 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 123 [2018-11-14 16:54:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:54:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2018-11-14 16:54:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:54:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2018-11-14 16:54:52,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 190 transitions. [2018-11-14 16:54:52,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:52,865 INFO L225 Difference]: With dead ends: 232 [2018-11-14 16:54:52,865 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 16:54:52,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:54:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 16:54:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-11-14 16:54:52,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:52,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 143 states. [2018-11-14 16:54:52,910 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 143 states. [2018-11-14 16:54:52,910 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 143 states. [2018-11-14 16:54:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:52,914 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-11-14 16:54:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-11-14 16:54:52,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:52,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:52,915 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 148 states. [2018-11-14 16:54:52,915 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 148 states. [2018-11-14 16:54:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:52,918 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-11-14 16:54:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-11-14 16:54:52,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:52,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:52,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:52,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 16:54:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-11-14 16:54:52,922 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 123 [2018-11-14 16:54:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:52,923 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-11-14 16:54:52,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:54:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-11-14 16:54:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-14 16:54:52,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:52,925 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 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] [2018-11-14 16:54:52,925 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:52,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2058581810, now seen corresponding path program 13 times [2018-11-14 16:54:52,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:52,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:52,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:53,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {10823#true} call ULTIMATE.init(); {10823#true} is VALID [2018-11-14 16:54:53,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {10823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10823#true} is VALID [2018-11-14 16:54:53,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {10823#true} assume true; {10823#true} is VALID [2018-11-14 16:54:53,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10823#true} {10823#true} #111#return; {10823#true} is VALID [2018-11-14 16:54:53,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {10823#true} call #t~ret13 := main(); {10823#true} is VALID [2018-11-14 16:54:53,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {10823#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);havoc ~a~0;~a~0 := 0; {10825#(= main_~a~0 0)} is VALID [2018-11-14 16:54:53,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {10825#(= main_~a~0 0)} assume true; {10825#(= main_~a~0 0)} is VALID [2018-11-14 16:54:53,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {10825#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10825#(= main_~a~0 0)} is VALID [2018-11-14 16:54:53,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {10825#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {10826#(<= main_~a~0 1)} assume true; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {10826#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {10826#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {10827#(<= main_~a~0 2)} assume true; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {10827#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {10827#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {10828#(<= main_~a~0 3)} assume true; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {10828#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= main_~a~0 4)} assume true; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {10829#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {10829#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {10830#(<= main_~a~0 5)} assume true; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {10830#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {10830#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {10831#(<= main_~a~0 6)} assume true; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {10831#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {10831#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {10832#(<= main_~a~0 7)} assume true; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {10832#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {10832#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {10833#(<= main_~a~0 8)} assume true; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {10833#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {10833#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {10834#(<= main_~a~0 9)} assume true; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {10834#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {10834#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {10835#(<= main_~a~0 10)} assume true; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {10835#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {10835#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {10836#(<= main_~a~0 11)} assume true; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {10836#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {10836#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {10837#(<= main_~a~0 12)} assume true; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,261 INFO L273 TraceCheckUtils]: 43: Hoare triple {10837#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {10837#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10838#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:53,263 INFO L273 TraceCheckUtils]: 45: Hoare triple {10838#(<= main_~a~0 13)} assume true; {10838#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:53,263 INFO L273 TraceCheckUtils]: 46: Hoare triple {10838#(<= main_~a~0 13)} assume !(~a~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {10824#false} havoc ~i~0;~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,264 INFO L273 TraceCheckUtils]: 48: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,264 INFO L273 TraceCheckUtils]: 49: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,264 INFO L273 TraceCheckUtils]: 50: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,265 INFO L273 TraceCheckUtils]: 54: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,265 INFO L273 TraceCheckUtils]: 55: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,265 INFO L273 TraceCheckUtils]: 56: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,266 INFO L273 TraceCheckUtils]: 59: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,266 INFO L273 TraceCheckUtils]: 60: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 65: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 67: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 68: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,267 INFO L273 TraceCheckUtils]: 69: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 71: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 72: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 75: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 76: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 77: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,268 INFO L273 TraceCheckUtils]: 78: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 81: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 82: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 83: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 84: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 85: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,269 INFO L273 TraceCheckUtils]: 86: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 87: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 88: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 89: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 90: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 91: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 92: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 93: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 94: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,270 INFO L273 TraceCheckUtils]: 95: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 96: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 97: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 98: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 101: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 102: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,271 INFO L273 TraceCheckUtils]: 103: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 104: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 105: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 106: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 107: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 108: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 109: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 110: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 111: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,272 INFO L273 TraceCheckUtils]: 112: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 113: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 114: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 115: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 116: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 117: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 118: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 119: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 120: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,273 INFO L273 TraceCheckUtils]: 121: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 122: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 123: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 124: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 125: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 126: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,274 INFO L273 TraceCheckUtils]: 128: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 130: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 131: Hoare triple {10824#false} havoc ~x~0;~x~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 132: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 133: Hoare triple {10824#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L256 TraceCheckUtils]: 134: Hoare triple {10824#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {10824#false} is VALID [2018-11-14 16:54:53,275 INFO L273 TraceCheckUtils]: 135: Hoare triple {10824#false} ~cond := #in~cond; {10824#false} is VALID [2018-11-14 16:54:53,276 INFO L273 TraceCheckUtils]: 136: Hoare triple {10824#false} assume ~cond == 0; {10824#false} is VALID [2018-11-14 16:54:53,276 INFO L273 TraceCheckUtils]: 137: Hoare triple {10824#false} assume !false; {10824#false} is VALID [2018-11-14 16:54:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 16:54:53,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:53,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 16:54:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:53,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:53,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {10823#true} call ULTIMATE.init(); {10823#true} is VALID [2018-11-14 16:54:53,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {10823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10823#true} is VALID [2018-11-14 16:54:53,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {10823#true} assume true; {10823#true} is VALID [2018-11-14 16:54:53,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10823#true} {10823#true} #111#return; {10823#true} is VALID [2018-11-14 16:54:53,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {10823#true} call #t~ret13 := main(); {10823#true} is VALID [2018-11-14 16:54:53,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {10823#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);havoc ~a~0;~a~0 := 0; {10857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:53,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {10857#(<= main_~a~0 0)} assume true; {10857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:53,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {10857#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10857#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:53,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {10857#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {10826#(<= main_~a~0 1)} assume true; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {10826#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10826#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:53,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {10826#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {10827#(<= main_~a~0 2)} assume true; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {10827#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10827#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:53,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {10827#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {10828#(<= main_~a~0 3)} assume true; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {10828#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10828#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:53,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= main_~a~0 4)} assume true; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {10829#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10829#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:53,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {10829#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {10830#(<= main_~a~0 5)} assume true; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {10830#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10830#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:53,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {10830#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {10831#(<= main_~a~0 6)} assume true; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {10831#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10831#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:53,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {10831#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {10832#(<= main_~a~0 7)} assume true; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {10832#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10832#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:53,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {10832#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {10833#(<= main_~a~0 8)} assume true; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {10833#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10833#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:53,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {10833#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {10834#(<= main_~a~0 9)} assume true; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {10834#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10834#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:53,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {10834#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {10835#(<= main_~a~0 10)} assume true; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {10835#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10835#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:53,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {10835#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {10836#(<= main_~a~0 11)} assume true; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {10836#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {10836#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:53,601 INFO L273 TraceCheckUtils]: 41: Hoare triple {10836#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,601 INFO L273 TraceCheckUtils]: 42: Hoare triple {10837#(<= main_~a~0 12)} assume true; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,602 INFO L273 TraceCheckUtils]: 43: Hoare triple {10837#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {10837#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:53,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {10837#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10838#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:53,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {10838#(<= main_~a~0 13)} assume true; {10838#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:53,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {10838#(<= main_~a~0 13)} assume !(~a~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {10824#false} havoc ~i~0;~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,605 INFO L273 TraceCheckUtils]: 51: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,605 INFO L273 TraceCheckUtils]: 52: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 55: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 59: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 60: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 61: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 62: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 64: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 65: Hoare triple {10824#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 66: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 67: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 68: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 69: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 70: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 71: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,607 INFO L273 TraceCheckUtils]: 72: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 73: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 74: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 75: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 76: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 77: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 78: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 79: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,608 INFO L273 TraceCheckUtils]: 80: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 81: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 82: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 83: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 84: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 85: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 86: Hoare triple {10824#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 87: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 88: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,609 INFO L273 TraceCheckUtils]: 89: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 90: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 91: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 92: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 93: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 94: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 95: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 96: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 97: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,610 INFO L273 TraceCheckUtils]: 98: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 99: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 100: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 102: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 103: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 104: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 105: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,611 INFO L273 TraceCheckUtils]: 106: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 107: Hoare triple {10824#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 108: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 109: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 110: Hoare triple {10824#false} ~i~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 111: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 112: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 113: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 114: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,612 INFO L273 TraceCheckUtils]: 115: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 116: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 117: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 118: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 119: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 120: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 121: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 122: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 123: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,613 INFO L273 TraceCheckUtils]: 124: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 125: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 126: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 127: Hoare triple {10824#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 128: Hoare triple {10824#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 129: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 130: Hoare triple {10824#false} assume !(~i~0 < 100000); {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 131: Hoare triple {10824#false} havoc ~x~0;~x~0 := 0; {10824#false} is VALID [2018-11-14 16:54:53,614 INFO L273 TraceCheckUtils]: 132: Hoare triple {10824#false} assume true; {10824#false} is VALID [2018-11-14 16:54:53,615 INFO L273 TraceCheckUtils]: 133: Hoare triple {10824#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {10824#false} is VALID [2018-11-14 16:54:53,615 INFO L256 TraceCheckUtils]: 134: Hoare triple {10824#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {10824#false} is VALID [2018-11-14 16:54:53,615 INFO L273 TraceCheckUtils]: 135: Hoare triple {10824#false} ~cond := #in~cond; {10824#false} is VALID [2018-11-14 16:54:53,615 INFO L273 TraceCheckUtils]: 136: Hoare triple {10824#false} assume ~cond == 0; {10824#false} is VALID [2018-11-14 16:54:53,615 INFO L273 TraceCheckUtils]: 137: Hoare triple {10824#false} assume !false; {10824#false} is VALID [2018-11-14 16:54:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 16:54:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:54:53,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2018-11-14 16:54:53,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:53,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:54:53,717 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-14 16:54:53,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:54:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:54:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:54:53,718 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 17 states. [2018-11-14 16:54:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:54,313 INFO L93 Difference]: Finished difference Result 243 states and 253 transitions. [2018-11-14 16:54:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:54:54,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2018-11-14 16:54:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:54:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-14 16:54:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:54:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-14 16:54:54,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2018-11-14 16:54:54,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:54,424 INFO L225 Difference]: With dead ends: 243 [2018-11-14 16:54:54,424 INFO L226 Difference]: Without dead ends: 147 [2018-11-14 16:54:54,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 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-14 16:54:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-14 16:54:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-11-14 16:54:54,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:54,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 146 states. [2018-11-14 16:54:54,465 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 146 states. [2018-11-14 16:54:54,465 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 146 states. [2018-11-14 16:54:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:54,468 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-14 16:54:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-11-14 16:54:54,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:54,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:54,468 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 147 states. [2018-11-14 16:54:54,468 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 147 states. [2018-11-14 16:54:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:54,471 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-14 16:54:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-11-14 16:54:54,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:54,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:54,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:54,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 16:54:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-11-14 16:54:54,475 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 138 [2018-11-14 16:54:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:54,475 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-11-14 16:54:54,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:54:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-14 16:54:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-14 16:54:54,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:54,477 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 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] [2018-11-14 16:54:54,477 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:54,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1805366511, now seen corresponding path program 14 times [2018-11-14 16:54:54,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:54,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:54,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {12067#true} call ULTIMATE.init(); {12067#true} is VALID [2018-11-14 16:54:54,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {12067#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12067#true} is VALID [2018-11-14 16:54:54,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {12067#true} assume true; {12067#true} is VALID [2018-11-14 16:54:54,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12067#true} {12067#true} #111#return; {12067#true} is VALID [2018-11-14 16:54:54,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {12067#true} call #t~ret13 := main(); {12067#true} is VALID [2018-11-14 16:54:54,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {12067#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);havoc ~a~0;~a~0 := 0; {12069#(= main_~a~0 0)} is VALID [2018-11-14 16:54:54,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {12069#(= main_~a~0 0)} assume true; {12069#(= main_~a~0 0)} is VALID [2018-11-14 16:54:54,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {12069#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12069#(= main_~a~0 0)} is VALID [2018-11-14 16:54:54,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {12069#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:54,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {12070#(<= main_~a~0 1)} assume true; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:54,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {12070#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:54,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {12070#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:54,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {12071#(<= main_~a~0 2)} assume true; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:54,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {12071#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:54,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {12071#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:54,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {12072#(<= main_~a~0 3)} assume true; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:54,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {12072#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:54,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {12072#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:54,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {12073#(<= main_~a~0 4)} assume true; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:54,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {12073#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:54,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {12073#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:54,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {12074#(<= main_~a~0 5)} assume true; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:54,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {12074#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:54,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {12074#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:54,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {12075#(<= main_~a~0 6)} assume true; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:54,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {12075#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:54,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {12075#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:54,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {12076#(<= main_~a~0 7)} assume true; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:54,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {12076#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:54,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {12076#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:54,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {12077#(<= main_~a~0 8)} assume true; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:54,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {12077#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:54,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {12077#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:54,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {12078#(<= main_~a~0 9)} assume true; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:54,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {12078#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:54,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {12078#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:54,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {12079#(<= main_~a~0 10)} assume true; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:54,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {12079#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:54,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {12079#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:54,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {12080#(<= main_~a~0 11)} assume true; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:54,812 INFO L273 TraceCheckUtils]: 40: Hoare triple {12080#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:54,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {12080#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:54,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {12081#(<= main_~a~0 12)} assume true; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:54,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {12081#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:54,815 INFO L273 TraceCheckUtils]: 44: Hoare triple {12081#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:54,816 INFO L273 TraceCheckUtils]: 45: Hoare triple {12082#(<= main_~a~0 13)} assume true; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:54,816 INFO L273 TraceCheckUtils]: 46: Hoare triple {12082#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:54,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {12082#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12083#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:54,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {12083#(<= main_~a~0 14)} assume true; {12083#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:54,818 INFO L273 TraceCheckUtils]: 49: Hoare triple {12083#(<= main_~a~0 14)} assume !(~a~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:54,818 INFO L273 TraceCheckUtils]: 50: Hoare triple {12068#false} havoc ~i~0;~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:54,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,819 INFO L273 TraceCheckUtils]: 52: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,819 INFO L273 TraceCheckUtils]: 54: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,820 INFO L273 TraceCheckUtils]: 58: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,820 INFO L273 TraceCheckUtils]: 59: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,820 INFO L273 TraceCheckUtils]: 60: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,821 INFO L273 TraceCheckUtils]: 62: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,821 INFO L273 TraceCheckUtils]: 63: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,821 INFO L273 TraceCheckUtils]: 64: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,821 INFO L273 TraceCheckUtils]: 65: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,821 INFO L273 TraceCheckUtils]: 66: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 67: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 68: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 70: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,822 INFO L273 TraceCheckUtils]: 74: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 79: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 80: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 81: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 82: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,823 INFO L273 TraceCheckUtils]: 83: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 84: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 85: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 86: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 87: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 88: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 89: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 90: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,824 INFO L273 TraceCheckUtils]: 91: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 93: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 94: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 95: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 96: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 97: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,825 INFO L273 TraceCheckUtils]: 98: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,826 INFO L273 TraceCheckUtils]: 99: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,826 INFO L273 TraceCheckUtils]: 100: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,826 INFO L273 TraceCheckUtils]: 101: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,826 INFO L273 TraceCheckUtils]: 102: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,826 INFO L273 TraceCheckUtils]: 103: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 104: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 105: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 106: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 107: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 108: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,827 INFO L273 TraceCheckUtils]: 109: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 110: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 111: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 112: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 113: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 114: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,828 INFO L273 TraceCheckUtils]: 115: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 116: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 117: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 118: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 119: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 120: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,829 INFO L273 TraceCheckUtils]: 121: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 122: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 123: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 124: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 125: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 126: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,830 INFO L273 TraceCheckUtils]: 127: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 128: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 129: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 130: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 131: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 132: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 133: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:54,831 INFO L273 TraceCheckUtils]: 134: Hoare triple {12068#false} havoc ~x~0;~x~0 := 0; {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L273 TraceCheckUtils]: 135: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L273 TraceCheckUtils]: 136: Hoare triple {12068#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L256 TraceCheckUtils]: 137: Hoare triple {12068#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L273 TraceCheckUtils]: 138: Hoare triple {12068#false} ~cond := #in~cond; {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L273 TraceCheckUtils]: 139: Hoare triple {12068#false} assume ~cond == 0; {12068#false} is VALID [2018-11-14 16:54:54,832 INFO L273 TraceCheckUtils]: 140: Hoare triple {12068#false} assume !false; {12068#false} is VALID [2018-11-14 16:54:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 16:54:54,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:54,844 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-14 16:54:54,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:54,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:54,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:54,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:55,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {12067#true} call ULTIMATE.init(); {12067#true} is VALID [2018-11-14 16:54:55,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {12067#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12067#true} is VALID [2018-11-14 16:54:55,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {12067#true} assume true; {12067#true} is VALID [2018-11-14 16:54:55,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12067#true} {12067#true} #111#return; {12067#true} is VALID [2018-11-14 16:54:55,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {12067#true} call #t~ret13 := main(); {12067#true} is VALID [2018-11-14 16:54:55,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {12067#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);havoc ~a~0;~a~0 := 0; {12102#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:55,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {12102#(<= main_~a~0 0)} assume true; {12102#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:55,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {12102#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12102#(<= main_~a~0 0)} is VALID [2018-11-14 16:54:55,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {12102#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:55,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {12070#(<= main_~a~0 1)} assume true; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:55,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {12070#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12070#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:55,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {12070#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:55,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {12071#(<= main_~a~0 2)} assume true; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:55,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {12071#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12071#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:55,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {12071#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:55,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {12072#(<= main_~a~0 3)} assume true; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:55,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {12072#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12072#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:55,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {12072#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:55,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {12073#(<= main_~a~0 4)} assume true; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:55,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {12073#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12073#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:55,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {12073#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:55,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {12074#(<= main_~a~0 5)} assume true; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:55,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {12074#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12074#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:55,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {12074#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:55,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {12075#(<= main_~a~0 6)} assume true; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:55,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {12075#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12075#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:55,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {12075#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:55,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {12076#(<= main_~a~0 7)} assume true; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:55,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {12076#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12076#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:55,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {12076#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:55,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {12077#(<= main_~a~0 8)} assume true; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:55,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {12077#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12077#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:55,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {12077#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:55,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {12078#(<= main_~a~0 9)} assume true; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:55,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {12078#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12078#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:55,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {12078#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:55,198 INFO L273 TraceCheckUtils]: 36: Hoare triple {12079#(<= main_~a~0 10)} assume true; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:55,198 INFO L273 TraceCheckUtils]: 37: Hoare triple {12079#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12079#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:55,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {12079#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:55,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {12080#(<= main_~a~0 11)} assume true; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:55,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {12080#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {12080#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:55,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {12080#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:55,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {12081#(<= main_~a~0 12)} assume true; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:55,202 INFO L273 TraceCheckUtils]: 43: Hoare triple {12081#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12081#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:55,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {12081#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:55,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {12082#(<= main_~a~0 13)} assume true; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:55,204 INFO L273 TraceCheckUtils]: 46: Hoare triple {12082#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {12082#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:55,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {12082#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {12083#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:55,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {12083#(<= main_~a~0 14)} assume true; {12083#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:55,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {12083#(<= main_~a~0 14)} assume !(~a~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:55,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {12068#false} havoc ~i~0;~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:55,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,206 INFO L273 TraceCheckUtils]: 52: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,207 INFO L273 TraceCheckUtils]: 55: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,207 INFO L273 TraceCheckUtils]: 56: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,207 INFO L273 TraceCheckUtils]: 57: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,208 INFO L273 TraceCheckUtils]: 58: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,208 INFO L273 TraceCheckUtils]: 59: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,208 INFO L273 TraceCheckUtils]: 60: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,209 INFO L273 TraceCheckUtils]: 64: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 66: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 67: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {12068#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 69: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 70: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:55,210 INFO L273 TraceCheckUtils]: 71: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 72: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 73: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 74: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 75: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 76: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,211 INFO L273 TraceCheckUtils]: 77: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 78: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 79: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 80: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 81: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 82: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,212 INFO L273 TraceCheckUtils]: 83: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 86: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 87: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 88: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {12068#false} is VALID [2018-11-14 16:54:55,213 INFO L273 TraceCheckUtils]: 89: Hoare triple {12068#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 93: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 95: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,214 INFO L273 TraceCheckUtils]: 96: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,215 INFO L273 TraceCheckUtils]: 100: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,215 INFO L273 TraceCheckUtils]: 101: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 103: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 106: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,216 INFO L273 TraceCheckUtils]: 107: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 109: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {12068#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 112: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:55,217 INFO L273 TraceCheckUtils]: 113: Hoare triple {12068#false} ~i~0 := 0; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 114: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 115: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 117: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,218 INFO L273 TraceCheckUtils]: 119: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 120: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 121: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 122: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 123: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 124: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,219 INFO L273 TraceCheckUtils]: 125: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 126: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 127: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 128: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 129: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 130: Hoare triple {12068#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {12068#false} is VALID [2018-11-14 16:54:55,220 INFO L273 TraceCheckUtils]: 131: Hoare triple {12068#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L273 TraceCheckUtils]: 132: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L273 TraceCheckUtils]: 133: Hoare triple {12068#false} assume !(~i~0 < 100000); {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L273 TraceCheckUtils]: 134: Hoare triple {12068#false} havoc ~x~0;~x~0 := 0; {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {12068#false} assume true; {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L273 TraceCheckUtils]: 136: Hoare triple {12068#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {12068#false} is VALID [2018-11-14 16:54:55,221 INFO L256 TraceCheckUtils]: 137: Hoare triple {12068#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {12068#false} is VALID [2018-11-14 16:54:55,222 INFO L273 TraceCheckUtils]: 138: Hoare triple {12068#false} ~cond := #in~cond; {12068#false} is VALID [2018-11-14 16:54:55,222 INFO L273 TraceCheckUtils]: 139: Hoare triple {12068#false} assume ~cond == 0; {12068#false} is VALID [2018-11-14 16:54:55,222 INFO L273 TraceCheckUtils]: 140: Hoare triple {12068#false} assume !false; {12068#false} is VALID [2018-11-14 16:54:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 16:54:55,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:54:55,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2018-11-14 16:54:55,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:55,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:54:55,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:55,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:54:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:54:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:54:55,342 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 18 states. [2018-11-14 16:54:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:56,175 INFO L93 Difference]: Finished difference Result 246 states and 256 transitions. [2018-11-14 16:54:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:54:56,176 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2018-11-14 16:54:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:54:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-14 16:54:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:54:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2018-11-14 16:54:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2018-11-14 16:54:56,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:56,296 INFO L225 Difference]: With dead ends: 246 [2018-11-14 16:54:56,296 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 16:54:56,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:54:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 16:54:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-14 16:54:56,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:56,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-14 16:54:56,332 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-14 16:54:56,332 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-14 16:54:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:56,335 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-14 16:54:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-14 16:54:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:56,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:56,336 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-14 16:54:56,336 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-14 16:54:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:56,339 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-14 16:54:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-14 16:54:56,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:56,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:56,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:56,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 16:54:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2018-11-14 16:54:56,342 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 141 [2018-11-14 16:54:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:56,343 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2018-11-14 16:54:56,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:54:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2018-11-14 16:54:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-14 16:54:56,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:56,344 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 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] [2018-11-14 16:54:56,345 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:56,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1023669970, now seen corresponding path program 15 times [2018-11-14 16:54:56,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:56,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:56,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:56,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {13335#true} call ULTIMATE.init(); {13335#true} is VALID [2018-11-14 16:54:56,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {13335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13335#true} is VALID [2018-11-14 16:54:56,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:56,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13335#true} {13335#true} #111#return; {13335#true} is VALID [2018-11-14 16:54:56,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {13335#true} call #t~ret13 := main(); {13335#true} is VALID [2018-11-14 16:54:56,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {13335#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);havoc ~a~0;~a~0 := 0; {13337#(= main_~a~0 0)} is VALID [2018-11-14 16:54:56,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {13337#(= main_~a~0 0)} assume true; {13337#(= main_~a~0 0)} is VALID [2018-11-14 16:54:56,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {13337#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13337#(= main_~a~0 0)} is VALID [2018-11-14 16:54:56,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {13337#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13338#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:56,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {13338#(<= main_~a~0 1)} assume true; {13338#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:56,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {13338#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13338#(<= main_~a~0 1)} is VALID [2018-11-14 16:54:56,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {13338#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13339#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:56,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {13339#(<= main_~a~0 2)} assume true; {13339#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:56,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {13339#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13339#(<= main_~a~0 2)} is VALID [2018-11-14 16:54:56,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {13339#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13340#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:56,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {13340#(<= main_~a~0 3)} assume true; {13340#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:56,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {13340#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13340#(<= main_~a~0 3)} is VALID [2018-11-14 16:54:56,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {13340#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13341#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:56,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {13341#(<= main_~a~0 4)} assume true; {13341#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:56,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {13341#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13341#(<= main_~a~0 4)} is VALID [2018-11-14 16:54:56,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {13341#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13342#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:56,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {13342#(<= main_~a~0 5)} assume true; {13342#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:56,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {13342#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13342#(<= main_~a~0 5)} is VALID [2018-11-14 16:54:56,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {13342#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13343#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:56,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {13343#(<= main_~a~0 6)} assume true; {13343#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:56,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {13343#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13343#(<= main_~a~0 6)} is VALID [2018-11-14 16:54:56,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {13343#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13344#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:56,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {13344#(<= main_~a~0 7)} assume true; {13344#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:56,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {13344#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13344#(<= main_~a~0 7)} is VALID [2018-11-14 16:54:56,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {13344#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13345#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:56,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {13345#(<= main_~a~0 8)} assume true; {13345#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:56,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {13345#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13345#(<= main_~a~0 8)} is VALID [2018-11-14 16:54:56,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {13345#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13346#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:56,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {13346#(<= main_~a~0 9)} assume true; {13346#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:56,623 INFO L273 TraceCheckUtils]: 34: Hoare triple {13346#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13346#(<= main_~a~0 9)} is VALID [2018-11-14 16:54:56,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {13346#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13347#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:56,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {13347#(<= main_~a~0 10)} assume true; {13347#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:56,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {13347#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13347#(<= main_~a~0 10)} is VALID [2018-11-14 16:54:56,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {13347#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13348#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:56,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {13348#(<= main_~a~0 11)} assume true; {13348#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:56,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {13348#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13348#(<= main_~a~0 11)} is VALID [2018-11-14 16:54:56,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {13348#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13349#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:56,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {13349#(<= main_~a~0 12)} assume true; {13349#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:56,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {13349#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13349#(<= main_~a~0 12)} is VALID [2018-11-14 16:54:56,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {13349#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13350#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:56,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {13350#(<= main_~a~0 13)} assume true; {13350#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:56,630 INFO L273 TraceCheckUtils]: 46: Hoare triple {13350#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13350#(<= main_~a~0 13)} is VALID [2018-11-14 16:54:56,631 INFO L273 TraceCheckUtils]: 47: Hoare triple {13350#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13351#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:56,631 INFO L273 TraceCheckUtils]: 48: Hoare triple {13351#(<= main_~a~0 14)} assume true; {13351#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:56,632 INFO L273 TraceCheckUtils]: 49: Hoare triple {13351#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {13351#(<= main_~a~0 14)} is VALID [2018-11-14 16:54:56,632 INFO L273 TraceCheckUtils]: 50: Hoare triple {13351#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13352#(<= main_~a~0 15)} is VALID [2018-11-14 16:54:56,633 INFO L273 TraceCheckUtils]: 51: Hoare triple {13352#(<= main_~a~0 15)} assume true; {13352#(<= main_~a~0 15)} is VALID [2018-11-14 16:54:56,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {13352#(<= main_~a~0 15)} assume !(~a~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 53: Hoare triple {13336#false} havoc ~i~0;~i~0 := 0; {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 54: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 55: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 57: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,634 INFO L273 TraceCheckUtils]: 58: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,635 INFO L273 TraceCheckUtils]: 59: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,635 INFO L273 TraceCheckUtils]: 62: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,635 INFO L273 TraceCheckUtils]: 63: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 64: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 65: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 67: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 69: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,636 INFO L273 TraceCheckUtils]: 70: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 71: Hoare triple {13336#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {13336#false} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {13336#false} ~i~0 := 0; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 75: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 77: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 78: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,637 INFO L273 TraceCheckUtils]: 79: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 80: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 81: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 82: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 83: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 84: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 85: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 86: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 87: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,638 INFO L273 TraceCheckUtils]: 88: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 89: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 90: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 91: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 92: Hoare triple {13336#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 94: Hoare triple {13336#false} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {13336#false} ~i~0 := 0; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 96: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,639 INFO L273 TraceCheckUtils]: 97: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 98: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 99: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 100: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 101: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 102: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 103: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 104: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 105: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,640 INFO L273 TraceCheckUtils]: 106: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 107: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 108: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 109: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 110: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 111: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 112: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 113: Hoare triple {13336#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 114: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,641 INFO L273 TraceCheckUtils]: 115: Hoare triple {13336#false} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 116: Hoare triple {13336#false} ~i~0 := 0; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 117: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 118: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 119: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 120: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 121: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 122: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 123: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,642 INFO L273 TraceCheckUtils]: 124: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 125: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 126: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 127: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 128: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 129: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 130: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 131: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,643 INFO L273 TraceCheckUtils]: 132: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 133: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 134: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 135: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 136: Hoare triple {13336#false} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 137: Hoare triple {13336#false} havoc ~x~0;~x~0 := 0; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 138: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 139: Hoare triple {13336#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L256 TraceCheckUtils]: 140: Hoare triple {13336#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13336#false} is VALID [2018-11-14 16:54:56,644 INFO L273 TraceCheckUtils]: 141: Hoare triple {13336#false} ~cond := #in~cond; {13336#false} is VALID [2018-11-14 16:54:56,645 INFO L273 TraceCheckUtils]: 142: Hoare triple {13336#false} assume ~cond == 0; {13336#false} is VALID [2018-11-14 16:54:56,645 INFO L273 TraceCheckUtils]: 143: Hoare triple {13336#false} assume !false; {13336#false} is VALID [2018-11-14 16:54:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-14 16:54:56,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:56,654 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-14 16:54:56,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:58,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 16:54:58,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:58,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:58,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {13335#true} call ULTIMATE.init(); {13335#true} is VALID [2018-11-14 16:54:58,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {13335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13335#true} is VALID [2018-11-14 16:54:58,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13335#true} {13335#true} #111#return; {13335#true} is VALID [2018-11-14 16:54:58,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {13335#true} call #t~ret13 := main(); {13335#true} is VALID [2018-11-14 16:54:58,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {13335#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);havoc ~a~0;~a~0 := 0; {13335#true} is VALID [2018-11-14 16:54:58,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 39: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 41: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 43: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 44: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 45: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 46: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {13335#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {13335#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {13335#true} is VALID [2018-11-14 16:54:58,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {13335#true} assume !(~a~0 < 100000); {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 53: Hoare triple {13335#true} havoc ~i~0;~i~0 := 0; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 55: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 59: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 64: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 65: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 66: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,678 INFO L273 TraceCheckUtils]: 67: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 69: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 70: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 71: Hoare triple {13335#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 72: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,679 INFO L273 TraceCheckUtils]: 73: Hoare triple {13335#true} assume !(~i~0 < 100000); {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 74: Hoare triple {13335#true} ~i~0 := 0; {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 75: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 76: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 77: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 78: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,680 INFO L273 TraceCheckUtils]: 79: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 80: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 81: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 82: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 83: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 84: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 85: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 86: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 87: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,681 INFO L273 TraceCheckUtils]: 88: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 89: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 91: Hoare triple {13335#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 92: Hoare triple {13335#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 93: Hoare triple {13335#true} assume true; {13335#true} is VALID [2018-11-14 16:54:58,682 INFO L273 TraceCheckUtils]: 94: Hoare triple {13335#true} assume !(~i~0 < 100000); {13335#true} is VALID [2018-11-14 16:54:58,683 INFO L273 TraceCheckUtils]: 95: Hoare triple {13335#true} ~i~0 := 0; {13641#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:58,683 INFO L273 TraceCheckUtils]: 96: Hoare triple {13641#(<= main_~i~0 0)} assume true; {13641#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:58,704 INFO L273 TraceCheckUtils]: 97: Hoare triple {13641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13641#(<= main_~i~0 0)} is VALID [2018-11-14 16:54:58,712 INFO L273 TraceCheckUtils]: 98: Hoare triple {13641#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13651#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:58,714 INFO L273 TraceCheckUtils]: 99: Hoare triple {13651#(<= main_~i~0 1)} assume true; {13651#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:58,714 INFO L273 TraceCheckUtils]: 100: Hoare triple {13651#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13651#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:58,715 INFO L273 TraceCheckUtils]: 101: Hoare triple {13651#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13661#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:58,715 INFO L273 TraceCheckUtils]: 102: Hoare triple {13661#(<= main_~i~0 2)} assume true; {13661#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:58,715 INFO L273 TraceCheckUtils]: 103: Hoare triple {13661#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13661#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:58,716 INFO L273 TraceCheckUtils]: 104: Hoare triple {13661#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13671#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:58,716 INFO L273 TraceCheckUtils]: 105: Hoare triple {13671#(<= main_~i~0 3)} assume true; {13671#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:58,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {13671#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13671#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:58,717 INFO L273 TraceCheckUtils]: 107: Hoare triple {13671#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13681#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:58,717 INFO L273 TraceCheckUtils]: 108: Hoare triple {13681#(<= main_~i~0 4)} assume true; {13681#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:58,718 INFO L273 TraceCheckUtils]: 109: Hoare triple {13681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13681#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:58,718 INFO L273 TraceCheckUtils]: 110: Hoare triple {13681#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13691#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:58,719 INFO L273 TraceCheckUtils]: 111: Hoare triple {13691#(<= main_~i~0 5)} assume true; {13691#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:58,719 INFO L273 TraceCheckUtils]: 112: Hoare triple {13691#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {13691#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:58,720 INFO L273 TraceCheckUtils]: 113: Hoare triple {13691#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {13701#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:58,721 INFO L273 TraceCheckUtils]: 114: Hoare triple {13701#(<= main_~i~0 6)} assume true; {13701#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:58,721 INFO L273 TraceCheckUtils]: 115: Hoare triple {13701#(<= main_~i~0 6)} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:58,721 INFO L273 TraceCheckUtils]: 116: Hoare triple {13336#false} ~i~0 := 0; {13336#false} is VALID [2018-11-14 16:54:58,722 INFO L273 TraceCheckUtils]: 117: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,722 INFO L273 TraceCheckUtils]: 118: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,722 INFO L273 TraceCheckUtils]: 119: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,722 INFO L273 TraceCheckUtils]: 120: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,722 INFO L273 TraceCheckUtils]: 121: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,723 INFO L273 TraceCheckUtils]: 122: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,723 INFO L273 TraceCheckUtils]: 123: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,723 INFO L273 TraceCheckUtils]: 124: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,723 INFO L273 TraceCheckUtils]: 125: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,723 INFO L273 TraceCheckUtils]: 126: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 127: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 128: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 129: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 130: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 131: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 132: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,724 INFO L273 TraceCheckUtils]: 133: Hoare triple {13336#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 134: Hoare triple {13336#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 135: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 136: Hoare triple {13336#false} assume !(~i~0 < 100000); {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 137: Hoare triple {13336#false} havoc ~x~0;~x~0 := 0; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 138: Hoare triple {13336#false} assume true; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 139: Hoare triple {13336#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L256 TraceCheckUtils]: 140: Hoare triple {13336#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 141: Hoare triple {13336#false} ~cond := #in~cond; {13336#false} is VALID [2018-11-14 16:54:58,725 INFO L273 TraceCheckUtils]: 142: Hoare triple {13336#false} assume ~cond == 0; {13336#false} is VALID [2018-11-14 16:54:58,726 INFO L273 TraceCheckUtils]: 143: Hoare triple {13336#false} assume !false; {13336#false} is VALID [2018-11-14 16:54:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-11-14 16:54:58,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:58,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-11-14 16:54:58,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 144 [2018-11-14 16:54:58,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:58,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:54:58,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:58,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:54:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:54:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:54:58,874 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 25 states. [2018-11-14 16:54:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:59,656 INFO L93 Difference]: Finished difference Result 265 states and 279 transitions. [2018-11-14 16:54:59,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:54:59,656 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 144 [2018-11-14 16:54:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:54:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 211 transitions. [2018-11-14 16:54:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:54:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 211 transitions. [2018-11-14 16:54:59,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 211 transitions. [2018-11-14 16:54:59,844 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-14 16:54:59,847 INFO L225 Difference]: With dead ends: 265 [2018-11-14 16:54:59,847 INFO L226 Difference]: Without dead ends: 169 [2018-11-14 16:54:59,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:54:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-14 16:54:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-11-14 16:54:59,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:59,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 164 states. [2018-11-14 16:54:59,952 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 164 states. [2018-11-14 16:54:59,952 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 164 states. [2018-11-14 16:54:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:59,955 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-11-14 16:54:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2018-11-14 16:54:59,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:59,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:59,956 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 169 states. [2018-11-14 16:54:59,956 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 169 states. [2018-11-14 16:54:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:59,959 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-11-14 16:54:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2018-11-14 16:54:59,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:59,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:59,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:59,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 16:54:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 169 transitions. [2018-11-14 16:54:59,963 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 169 transitions. Word has length 144 [2018-11-14 16:54:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:59,963 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 169 transitions. [2018-11-14 16:54:59,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 16:54:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 169 transitions. [2018-11-14 16:54:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-14 16:54:59,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:59,965 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:59,965 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:59,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -702725397, now seen corresponding path program 16 times [2018-11-14 16:54:59,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:59,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:00,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {14701#true} call ULTIMATE.init(); {14701#true} is VALID [2018-11-14 16:55:00,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {14701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14701#true} is VALID [2018-11-14 16:55:00,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {14701#true} assume true; {14701#true} is VALID [2018-11-14 16:55:00,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14701#true} {14701#true} #111#return; {14701#true} is VALID [2018-11-14 16:55:00,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {14701#true} call #t~ret13 := main(); {14701#true} is VALID [2018-11-14 16:55:00,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {14701#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);havoc ~a~0;~a~0 := 0; {14703#(= main_~a~0 0)} is VALID [2018-11-14 16:55:00,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {14703#(= main_~a~0 0)} assume true; {14703#(= main_~a~0 0)} is VALID [2018-11-14 16:55:00,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {14703#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14703#(= main_~a~0 0)} is VALID [2018-11-14 16:55:00,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {14703#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:00,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {14704#(<= main_~a~0 1)} assume true; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:00,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {14704#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:00,929 INFO L273 TraceCheckUtils]: 11: Hoare triple {14704#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:00,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {14705#(<= main_~a~0 2)} assume true; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:00,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {14705#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:00,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {14705#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:00,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {14706#(<= main_~a~0 3)} assume true; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:00,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {14706#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:00,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {14706#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:00,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {14707#(<= main_~a~0 4)} assume true; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:00,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {14707#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:00,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {14707#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:00,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {14708#(<= main_~a~0 5)} assume true; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:00,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {14708#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:00,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {14708#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:00,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {14709#(<= main_~a~0 6)} assume true; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:00,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {14709#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:00,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {14709#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:00,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {14710#(<= main_~a~0 7)} assume true; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:00,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {14710#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:00,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {14710#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:00,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {14711#(<= main_~a~0 8)} assume true; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:00,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {14711#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:00,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {14711#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:00,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {14712#(<= main_~a~0 9)} assume true; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:00,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {14712#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:00,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {14712#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:00,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {14713#(<= main_~a~0 10)} assume true; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:00,943 INFO L273 TraceCheckUtils]: 37: Hoare triple {14713#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:00,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {14713#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:00,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {14714#(<= main_~a~0 11)} assume true; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:00,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {14714#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:00,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {14714#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:00,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {14715#(<= main_~a~0 12)} assume true; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:00,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {14715#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:00,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {14715#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:00,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {14716#(<= main_~a~0 13)} assume true; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:00,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {14716#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:00,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {14716#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:00,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {14717#(<= main_~a~0 14)} assume true; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:00,950 INFO L273 TraceCheckUtils]: 49: Hoare triple {14717#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:00,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {14717#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:00,951 INFO L273 TraceCheckUtils]: 51: Hoare triple {14718#(<= main_~a~0 15)} assume true; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:00,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {14718#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:00,952 INFO L273 TraceCheckUtils]: 53: Hoare triple {14718#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14719#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:00,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {14719#(<= main_~a~0 16)} assume true; {14719#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:00,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {14719#(<= main_~a~0 16)} assume !(~a~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:00,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {14702#false} havoc ~i~0;~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:00,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,954 INFO L273 TraceCheckUtils]: 59: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,954 INFO L273 TraceCheckUtils]: 60: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,954 INFO L273 TraceCheckUtils]: 61: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,954 INFO L273 TraceCheckUtils]: 62: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 63: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 64: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 65: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 66: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 67: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 68: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,955 INFO L273 TraceCheckUtils]: 69: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 74: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 75: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 76: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 77: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:00,956 INFO L273 TraceCheckUtils]: 78: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 79: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 80: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 81: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 82: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 83: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 84: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 85: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 86: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,957 INFO L273 TraceCheckUtils]: 87: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 88: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 89: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 90: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 91: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 92: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 93: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 94: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,958 INFO L273 TraceCheckUtils]: 95: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 96: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 97: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 98: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 99: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 100: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 101: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 102: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 103: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:00,959 INFO L273 TraceCheckUtils]: 104: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 105: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 106: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 107: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 108: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 109: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 110: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 111: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 112: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,960 INFO L273 TraceCheckUtils]: 113: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 114: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 115: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 116: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 117: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 118: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 119: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 120: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 121: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,961 INFO L273 TraceCheckUtils]: 122: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 123: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 124: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 125: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 126: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 127: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 128: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 129: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 130: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,962 INFO L273 TraceCheckUtils]: 131: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 132: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 133: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 134: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 135: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 136: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 137: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 138: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 139: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,963 INFO L273 TraceCheckUtils]: 140: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 141: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 142: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 143: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 144: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 145: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 146: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 147: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,964 INFO L273 TraceCheckUtils]: 148: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 149: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 150: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 151: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 152: Hoare triple {14702#false} havoc ~x~0;~x~0 := 0; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 153: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 154: Hoare triple {14702#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L256 TraceCheckUtils]: 155: Hoare triple {14702#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 156: Hoare triple {14702#false} ~cond := #in~cond; {14702#false} is VALID [2018-11-14 16:55:00,965 INFO L273 TraceCheckUtils]: 157: Hoare triple {14702#false} assume ~cond == 0; {14702#false} is VALID [2018-11-14 16:55:00,966 INFO L273 TraceCheckUtils]: 158: Hoare triple {14702#false} assume !false; {14702#false} is VALID [2018-11-14 16:55:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-14 16:55:00,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:00,976 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-14 16:55:00,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:01,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:01,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:01,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:01,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {14701#true} call ULTIMATE.init(); {14701#true} is VALID [2018-11-14 16:55:01,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {14701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14701#true} is VALID [2018-11-14 16:55:01,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {14701#true} assume true; {14701#true} is VALID [2018-11-14 16:55:01,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14701#true} {14701#true} #111#return; {14701#true} is VALID [2018-11-14 16:55:01,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {14701#true} call #t~ret13 := main(); {14701#true} is VALID [2018-11-14 16:55:01,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {14701#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);havoc ~a~0;~a~0 := 0; {14738#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:01,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {14738#(<= main_~a~0 0)} assume true; {14738#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:01,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {14738#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14738#(<= main_~a~0 0)} is VALID [2018-11-14 16:55:01,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {14738#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:01,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {14704#(<= main_~a~0 1)} assume true; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:01,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {14704#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14704#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:01,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {14704#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:01,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {14705#(<= main_~a~0 2)} assume true; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:01,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {14705#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14705#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:01,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {14705#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:01,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {14706#(<= main_~a~0 3)} assume true; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:01,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {14706#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14706#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:01,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {14706#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:01,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {14707#(<= main_~a~0 4)} assume true; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:01,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {14707#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14707#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:01,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {14707#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:01,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {14708#(<= main_~a~0 5)} assume true; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:01,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {14708#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14708#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:01,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {14708#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:01,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {14709#(<= main_~a~0 6)} assume true; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:01,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {14709#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14709#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:01,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {14709#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:01,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {14710#(<= main_~a~0 7)} assume true; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:01,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {14710#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14710#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:01,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {14710#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:01,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {14711#(<= main_~a~0 8)} assume true; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:01,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {14711#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14711#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:01,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {14711#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:01,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {14712#(<= main_~a~0 9)} assume true; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:01,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {14712#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14712#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:01,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {14712#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:01,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {14713#(<= main_~a~0 10)} assume true; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:01,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {14713#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14713#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:01,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {14713#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:01,405 INFO L273 TraceCheckUtils]: 39: Hoare triple {14714#(<= main_~a~0 11)} assume true; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:01,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {14714#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {14714#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:01,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {14714#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:01,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {14715#(<= main_~a~0 12)} assume true; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:01,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {14715#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14715#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:01,408 INFO L273 TraceCheckUtils]: 44: Hoare triple {14715#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:01,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {14716#(<= main_~a~0 13)} assume true; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:01,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {14716#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14716#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:01,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {14716#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:01,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {14717#(<= main_~a~0 14)} assume true; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:01,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {14717#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14717#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:01,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {14717#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:01,412 INFO L273 TraceCheckUtils]: 51: Hoare triple {14718#(<= main_~a~0 15)} assume true; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:01,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {14718#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {14718#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:01,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {14718#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14719#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:01,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {14719#(<= main_~a~0 16)} assume true; {14719#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:01,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {14719#(<= main_~a~0 16)} assume !(~a~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:01,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {14702#false} havoc ~i~0;~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:01,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,415 INFO L273 TraceCheckUtils]: 59: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,415 INFO L273 TraceCheckUtils]: 61: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 64: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 65: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 66: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,416 INFO L273 TraceCheckUtils]: 67: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 68: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 69: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 70: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 71: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 72: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 73: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 77: Hoare triple {14702#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 78: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 79: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 80: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 81: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 82: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,418 INFO L273 TraceCheckUtils]: 85: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 86: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 87: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 90: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 91: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 92: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 93: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,419 INFO L273 TraceCheckUtils]: 94: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 96: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 98: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 99: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,420 INFO L273 TraceCheckUtils]: 100: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {14702#false} is VALID [2018-11-14 16:55:01,421 INFO L273 TraceCheckUtils]: 101: Hoare triple {14702#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {14702#false} is VALID [2018-11-14 16:55:01,421 INFO L273 TraceCheckUtils]: 102: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,421 INFO L273 TraceCheckUtils]: 103: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:01,421 INFO L273 TraceCheckUtils]: 104: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:01,421 INFO L273 TraceCheckUtils]: 105: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 106: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 107: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 108: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 109: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 110: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,422 INFO L273 TraceCheckUtils]: 111: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 112: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 113: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 114: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 115: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 116: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,423 INFO L273 TraceCheckUtils]: 117: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 118: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 119: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 120: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 121: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 122: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,424 INFO L273 TraceCheckUtils]: 123: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 124: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {14702#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 126: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 127: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 128: Hoare triple {14702#false} ~i~0 := 0; {14702#false} is VALID [2018-11-14 16:55:01,425 INFO L273 TraceCheckUtils]: 129: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 130: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 131: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 132: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 133: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 134: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,426 INFO L273 TraceCheckUtils]: 135: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,427 INFO L273 TraceCheckUtils]: 136: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,427 INFO L273 TraceCheckUtils]: 137: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,427 INFO L273 TraceCheckUtils]: 138: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,427 INFO L273 TraceCheckUtils]: 139: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,427 INFO L273 TraceCheckUtils]: 140: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 141: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 142: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 143: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 144: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 145: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,428 INFO L273 TraceCheckUtils]: 146: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 147: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 148: Hoare triple {14702#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 149: Hoare triple {14702#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 150: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 151: Hoare triple {14702#false} assume !(~i~0 < 100000); {14702#false} is VALID [2018-11-14 16:55:01,429 INFO L273 TraceCheckUtils]: 152: Hoare triple {14702#false} havoc ~x~0;~x~0 := 0; {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L273 TraceCheckUtils]: 153: Hoare triple {14702#false} assume true; {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L273 TraceCheckUtils]: 154: Hoare triple {14702#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L256 TraceCheckUtils]: 155: Hoare triple {14702#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L273 TraceCheckUtils]: 156: Hoare triple {14702#false} ~cond := #in~cond; {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L273 TraceCheckUtils]: 157: Hoare triple {14702#false} assume ~cond == 0; {14702#false} is VALID [2018-11-14 16:55:01,430 INFO L273 TraceCheckUtils]: 158: Hoare triple {14702#false} assume !false; {14702#false} is VALID [2018-11-14 16:55:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-14 16:55:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 16:55:01,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-14 16:55:01,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:01,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:55:01,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:01,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:55:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:55:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:55:01,810 INFO L87 Difference]: Start difference. First operand 164 states and 169 transitions. Second operand 20 states. [2018-11-14 16:55:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:02,608 INFO L93 Difference]: Finished difference Result 276 states and 286 transitions. [2018-11-14 16:55:02,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:55:02,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2018-11-14 16:55:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:55:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2018-11-14 16:55:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:55:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2018-11-14 16:55:02,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 126 transitions. [2018-11-14 16:55:02,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:02,723 INFO L225 Difference]: With dead ends: 276 [2018-11-14 16:55:02,723 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 16:55:02,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:55:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 16:55:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-11-14 16:55:02,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:02,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 167 states. [2018-11-14 16:55:02,817 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 167 states. [2018-11-14 16:55:02,817 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 167 states. [2018-11-14 16:55:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:02,819 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-14 16:55:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2018-11-14 16:55:02,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:02,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:02,820 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 168 states. [2018-11-14 16:55:02,820 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 168 states. [2018-11-14 16:55:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:02,823 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-11-14 16:55:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2018-11-14 16:55:02,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:02,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:02,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:02,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 16:55:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 172 transitions. [2018-11-14 16:55:02,827 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 172 transitions. Word has length 159 [2018-11-14 16:55:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:02,827 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 172 transitions. [2018-11-14 16:55:02,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:55:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 172 transitions. [2018-11-14 16:55:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-14 16:55:02,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:02,829 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:02,829 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:02,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 297525356, now seen corresponding path program 17 times [2018-11-14 16:55:02,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:02,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:03,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {16125#true} call ULTIMATE.init(); {16125#true} is VALID [2018-11-14 16:55:03,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {16125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16125#true} is VALID [2018-11-14 16:55:03,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {16125#true} assume true; {16125#true} is VALID [2018-11-14 16:55:03,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16125#true} {16125#true} #111#return; {16125#true} is VALID [2018-11-14 16:55:03,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {16125#true} call #t~ret13 := main(); {16125#true} is VALID [2018-11-14 16:55:03,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {16125#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);havoc ~a~0;~a~0 := 0; {16127#(= main_~a~0 0)} is VALID [2018-11-14 16:55:03,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {16127#(= main_~a~0 0)} assume true; {16127#(= main_~a~0 0)} is VALID [2018-11-14 16:55:03,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {16127#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16127#(= main_~a~0 0)} is VALID [2018-11-14 16:55:03,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {16127#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16128#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:03,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {16128#(<= main_~a~0 1)} assume true; {16128#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:03,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {16128#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16128#(<= main_~a~0 1)} is VALID [2018-11-14 16:55:03,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {16128#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16129#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:03,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {16129#(<= main_~a~0 2)} assume true; {16129#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:03,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {16129#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16129#(<= main_~a~0 2)} is VALID [2018-11-14 16:55:03,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {16129#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16130#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:03,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {16130#(<= main_~a~0 3)} assume true; {16130#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:03,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {16130#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16130#(<= main_~a~0 3)} is VALID [2018-11-14 16:55:03,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {16130#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16131#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:03,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {16131#(<= main_~a~0 4)} assume true; {16131#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:03,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {16131#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16131#(<= main_~a~0 4)} is VALID [2018-11-14 16:55:03,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {16131#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16132#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:03,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {16132#(<= main_~a~0 5)} assume true; {16132#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:03,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {16132#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16132#(<= main_~a~0 5)} is VALID [2018-11-14 16:55:03,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {16132#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16133#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:03,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {16133#(<= main_~a~0 6)} assume true; {16133#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:03,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {16133#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16133#(<= main_~a~0 6)} is VALID [2018-11-14 16:55:03,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {16133#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16134#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:03,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {16134#(<= main_~a~0 7)} assume true; {16134#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:03,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {16134#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16134#(<= main_~a~0 7)} is VALID [2018-11-14 16:55:03,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {16134#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16135#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:03,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {16135#(<= main_~a~0 8)} assume true; {16135#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:03,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {16135#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16135#(<= main_~a~0 8)} is VALID [2018-11-14 16:55:03,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {16135#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16136#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:03,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {16136#(<= main_~a~0 9)} assume true; {16136#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:03,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {16136#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16136#(<= main_~a~0 9)} is VALID [2018-11-14 16:55:03,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {16136#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16137#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:03,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {16137#(<= main_~a~0 10)} assume true; {16137#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:03,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {16137#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16137#(<= main_~a~0 10)} is VALID [2018-11-14 16:55:03,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {16137#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16138#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:03,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {16138#(<= main_~a~0 11)} assume true; {16138#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:03,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {16138#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1; {16138#(<= main_~a~0 11)} is VALID [2018-11-14 16:55:03,328 INFO L273 TraceCheckUtils]: 41: Hoare triple {16138#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16139#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:03,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {16139#(<= main_~a~0 12)} assume true; {16139#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:03,329 INFO L273 TraceCheckUtils]: 43: Hoare triple {16139#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {16139#(<= main_~a~0 12)} is VALID [2018-11-14 16:55:03,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {16139#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16140#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:03,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {16140#(<= main_~a~0 13)} assume true; {16140#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:03,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {16140#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {16140#(<= main_~a~0 13)} is VALID [2018-11-14 16:55:03,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {16140#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16141#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:03,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {16141#(<= main_~a~0 14)} assume true; {16141#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:03,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {16141#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {16141#(<= main_~a~0 14)} is VALID [2018-11-14 16:55:03,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {16141#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16142#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:03,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {16142#(<= main_~a~0 15)} assume true; {16142#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:03,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {16142#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {16142#(<= main_~a~0 15)} is VALID [2018-11-14 16:55:03,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {16142#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16143#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:03,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {16143#(<= main_~a~0 16)} assume true; {16143#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:03,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {16143#(<= 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 + ~a~0 * 4, 4);havoc #t~nondet1; {16143#(<= main_~a~0 16)} is VALID [2018-11-14 16:55:03,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {16143#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16144#(<= main_~a~0 17)} is VALID [2018-11-14 16:55:03,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {16144#(<= main_~a~0 17)} assume true; {16144#(<= main_~a~0 17)} is VALID [2018-11-14 16:55:03,338 INFO L273 TraceCheckUtils]: 58: Hoare triple {16144#(<= main_~a~0 17)} assume !(~a~0 < 100000); {16126#false} is VALID [2018-11-14 16:55:03,338 INFO L273 TraceCheckUtils]: 59: Hoare triple {16126#false} havoc ~i~0;~i~0 := 0; {16126#false} is VALID [2018-11-14 16:55:03,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,339 INFO L273 TraceCheckUtils]: 64: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,339 INFO L273 TraceCheckUtils]: 67: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,340 INFO L273 TraceCheckUtils]: 68: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,340 INFO L273 TraceCheckUtils]: 69: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,340 INFO L273 TraceCheckUtils]: 70: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,340 INFO L273 TraceCheckUtils]: 71: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,340 INFO L273 TraceCheckUtils]: 72: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 73: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 76: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 77: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,341 INFO L273 TraceCheckUtils]: 78: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,342 INFO L273 TraceCheckUtils]: 79: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {16126#false} is VALID [2018-11-14 16:55:03,342 INFO L273 TraceCheckUtils]: 80: Hoare triple {16126#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {16126#false} is VALID [2018-11-14 16:55:03,342 INFO L273 TraceCheckUtils]: 81: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,342 INFO L273 TraceCheckUtils]: 82: Hoare triple {16126#false} assume !(~i~0 < 100000); {16126#false} is VALID [2018-11-14 16:55:03,342 INFO L273 TraceCheckUtils]: 83: Hoare triple {16126#false} ~i~0 := 0; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 84: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 85: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 86: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 87: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 88: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 89: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 90: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,343 INFO L273 TraceCheckUtils]: 91: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 92: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 93: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 94: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 95: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 96: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 97: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 98: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 99: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 100: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,344 INFO L273 TraceCheckUtils]: 101: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 102: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 103: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 104: Hoare triple {16126#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 105: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 106: Hoare triple {16126#false} assume !(~i~0 < 100000); {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 107: Hoare triple {16126#false} ~i~0 := 0; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 108: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 109: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,345 INFO L273 TraceCheckUtils]: 110: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 111: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 112: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 113: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 114: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 115: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 116: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 117: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 118: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,346 INFO L273 TraceCheckUtils]: 119: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 120: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 121: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 122: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 123: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 124: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 125: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 126: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 127: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem7 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {16126#false} is VALID [2018-11-14 16:55:03,347 INFO L273 TraceCheckUtils]: 128: Hoare triple {16126#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 129: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 130: Hoare triple {16126#false} assume !(~i~0 < 100000); {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 131: Hoare triple {16126#false} ~i~0 := 0; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 132: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 133: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 134: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 135: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 136: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 137: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,348 INFO L273 TraceCheckUtils]: 138: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 139: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 140: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 141: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 142: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 143: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 144: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 145: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 146: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,349 INFO L273 TraceCheckUtils]: 147: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 148: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 149: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 150: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 151: Hoare triple {16126#false} assume !!(~i~0 < 100000);call #t~mem9 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem9, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem9; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 152: Hoare triple {16126#false} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 153: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 154: Hoare triple {16126#false} assume !(~i~0 < 100000); {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 155: Hoare triple {16126#false} havoc ~x~0;~x~0 := 0; {16126#false} is VALID [2018-11-14 16:55:03,350 INFO L273 TraceCheckUtils]: 156: Hoare triple {16126#false} assume true; {16126#false} is VALID [2018-11-14 16:55:03,351 INFO L273 TraceCheckUtils]: 157: Hoare triple {16126#false} assume !!(~x~0 < 100000);call #t~mem11 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~x~0 * 4, 4); {16126#false} is VALID [2018-11-14 16:55:03,351 INFO L256 TraceCheckUtils]: 158: Hoare triple {16126#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1 else 0)); {16126#false} is VALID [2018-11-14 16:55:03,351 INFO L273 TraceCheckUtils]: 159: Hoare triple {16126#false} ~cond := #in~cond; {16126#false} is VALID [2018-11-14 16:55:03,351 INFO L273 TraceCheckUtils]: 160: Hoare triple {16126#false} assume ~cond == 0; {16126#false} is VALID [2018-11-14 16:55:03,351 INFO L273 TraceCheckUtils]: 161: Hoare triple {16126#false} assume !false; {16126#false} is VALID [2018-11-14 16:55:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-14 16:55:03,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:03,362 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-14 16:55:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1