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_partial_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:57:03,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:57:03,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:57:03,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:57:03,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:57:03,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:57:03,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:57:03,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:57:03,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:57:03,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:57:03,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:57:03,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:57:03,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:57:03,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:57:03,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:57:03,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:57:03,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:57:03,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:57:03,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:57:03,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:57:03,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:57:03,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:57:03,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:57:03,426 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:57:03,426 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:57:03,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:57:03,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:57:03,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:57:03,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:57:03,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:57:03,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:57:03,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:57:03,432 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:57:03,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:57:03,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:57:03,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:57:03,435 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:57:03,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:57:03,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:57:03,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:57:03,452 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:57:03,452 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:57:03,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:57:03,453 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:57:03,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:57:03,453 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:57:03,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:57:03,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:57:03,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:57:03,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:57:03,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:57:03,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:57:03,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:57:03,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:57:03,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:57:03,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:57:03,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:57:03,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:57:03,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:57:03,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:57:03,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:57:03,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:57:03,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:57:03,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:57:03,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:57:03,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:57:03,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:57:03,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:57:03,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:57:03,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:57:03,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:57:03,536 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:57:03,537 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-14 16:57:03,598 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc43836d9/e5a45a3e656a43fa9e997fa63ba81ed9/FLAG901561479 [2018-11-14 16:57:04,039 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:57:04,040 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-14 16:57:04,055 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc43836d9/e5a45a3e656a43fa9e997fa63ba81ed9/FLAG901561479 [2018-11-14 16:57:04,079 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc43836d9/e5a45a3e656a43fa9e997fa63ba81ed9 [2018-11-14 16:57:04,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:57:04,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:57:04,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:57:04,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:57:04,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:57:04,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2543e827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04, skipping insertion in model container [2018-11-14 16:57:04,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:57:04,149 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:57:04,340 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:57:04,345 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:57:04,371 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:57:04,394 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:57:04,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04 WrapperNode [2018-11-14 16:57:04,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:57:04,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:57:04,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:57:04,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:57:04,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (1/1) ... [2018-11-14 16:57:04,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:57:04,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:57:04,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:57:04,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:57:04,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (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:57:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:57:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:57:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:57:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:57:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:57:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:57:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:57:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:57:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:57:05,212 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:57:05,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:57:05 BoogieIcfgContainer [2018-11-14 16:57:05,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:57:05,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:57:05,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:57:05,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:57:05,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:57:04" (1/3) ... [2018-11-14 16:57:05,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686f18d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:57:05, skipping insertion in model container [2018-11-14 16:57:05,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:57:04" (2/3) ... [2018-11-14 16:57:05,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686f18d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:57:05, skipping insertion in model container [2018-11-14 16:57:05,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:57:05" (3/3) ... [2018-11-14 16:57:05,222 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partial_init_true-unreach-call_ground.i [2018-11-14 16:57:05,233 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:57:05,243 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:57:05,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:57:05,306 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:57:05,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:57:05,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:57:05,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:57:05,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:57:05,308 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:57:05,308 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:57:05,308 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:57:05,308 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:57:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 16:57:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:57:05,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:05,337 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:05,339 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:05,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1830056170, now seen corresponding path program 1 times [2018-11-14 16:57:05,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:05,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:05,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:05,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:05,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 16:57:05,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-14 16:57:05,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 16:57:05,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #73#return; {36#true} is VALID [2018-11-14 16:57:05,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2018-11-14 16:57:05,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-14 16:57:05,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 16:57:05,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-14 16:57:05,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:57:05,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {37#false} is VALID [2018-11-14 16:57:05,532 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {37#false} is VALID [2018-11-14 16:57:05,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 16:57:05,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume ~cond == 0; {37#false} is VALID [2018-11-14 16:57:05,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 16:57:05,537 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:57:05,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:57:05,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:57:05,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:57:05,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:05,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:57:05,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:57:05,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:57:05,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:57:05,699 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 16:57:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:05,946 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-14 16:57:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:57:05,946 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:57:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:57:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 16:57:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:57:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 16:57:05,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-14 16:57:06,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:06,242 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:57:06,243 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:57:06,246 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:57:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:57:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:57:06,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:06,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:57:06,298 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:57:06,298 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:57:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:06,304 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 16:57:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:57:06,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:06,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:06,305 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:57:06,306 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:57:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:06,311 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 16:57:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:57:06,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:06,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:06,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:06,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:57:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 16:57:06,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-14 16:57:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 16:57:06,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:57:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:57:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:57:06,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:06,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:06,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:06,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1980842670, now seen corresponding path program 1 times [2018-11-14 16:57:06,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:06,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:06,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2018-11-14 16:57:06,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {205#true} is VALID [2018-11-14 16:57:06,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2018-11-14 16:57:06,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #73#return; {205#true} is VALID [2018-11-14 16:57:06,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret7 := main(); {205#true} is VALID [2018-11-14 16:57:06,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {205#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {207#(= main_~i~0 0)} is VALID [2018-11-14 16:57:06,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#(= main_~i~0 0)} assume true; {207#(= main_~i~0 0)} is VALID [2018-11-14 16:57:06,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {207#(= main_~i~0 0)} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-14 16:57:06,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#false} havoc ~x~0;~x~0 := 0; {206#false} is VALID [2018-11-14 16:57:06,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#false} assume true; {206#false} is VALID [2018-11-14 16:57:06,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {206#false} is VALID [2018-11-14 16:57:06,432 INFO L256 TraceCheckUtils]: 11: Hoare triple {206#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {206#false} is VALID [2018-11-14 16:57:06,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2018-11-14 16:57:06,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#false} assume ~cond == 0; {206#false} is VALID [2018-11-14 16:57:06,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#false} assume !false; {206#false} is VALID [2018-11-14 16:57:06,434 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:57:06,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:57:06,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:57:06,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:57:06,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:06,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:57:06,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:06,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:57:06,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:57:06,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:57:06,482 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-14 16:57:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:06,909 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 16:57:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:57:06,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:57:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:57:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:57:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:57:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 16:57:06,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 16:57:07,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:07,101 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:57:07,101 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:57:07,102 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:57:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:57:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-14 16:57:07,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:07,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-14 16:57:07,124 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-14 16:57:07,125 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-14 16:57:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:07,128 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 16:57:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:57:07,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:07,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:07,130 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-14 16:57:07,130 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-14 16:57:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:07,134 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 16:57:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:57:07,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:07,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:07,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:07,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:57:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 16:57:07,138 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-14 16:57:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:07,139 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 16:57:07,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:57:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 16:57:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:57:07,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:07,140 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:07,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:07,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash -200640663, now seen corresponding path program 1 times [2018-11-14 16:57:07,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:07,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:07,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-14 16:57:07,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {381#true} is VALID [2018-11-14 16:57:07,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-14 16:57:07,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #73#return; {381#true} is VALID [2018-11-14 16:57:07,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret7 := main(); {381#true} is VALID [2018-11-14 16:57:07,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {383#(= main_~i~0 0)} is VALID [2018-11-14 16:57:07,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(= main_~i~0 0)} assume true; {383#(= main_~i~0 0)} is VALID [2018-11-14 16:57:07,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {383#(= main_~i~0 0)} is VALID [2018-11-14 16:57:07,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {383#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {383#(= main_~i~0 0)} is VALID [2018-11-14 16:57:07,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {383#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {384#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:07,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(<= main_~i~0 1)} assume true; {384#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:07,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {384#(<= main_~i~0 1)} assume !(~i~0 < 100000); {382#false} is VALID [2018-11-14 16:57:07,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#false} havoc ~x~0;~x~0 := 0; {382#false} is VALID [2018-11-14 16:57:07,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#false} assume true; {382#false} is VALID [2018-11-14 16:57:07,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {382#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {382#false} is VALID [2018-11-14 16:57:07,294 INFO L256 TraceCheckUtils]: 15: Hoare triple {382#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {382#false} is VALID [2018-11-14 16:57:07,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-14 16:57:07,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {382#false} assume ~cond == 0; {382#false} is VALID [2018-11-14 16:57:07,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-14 16:57:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:07,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:07,297 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:57:07,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:07,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:07,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-14 16:57:07,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {381#true} is VALID [2018-11-14 16:57:07,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-14 16:57:08,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #73#return; {381#true} is VALID [2018-11-14 16:57:08,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret7 := main(); {381#true} is VALID [2018-11-14 16:57:08,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {403#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:08,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(<= main_~i~0 0)} assume true; {403#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:08,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {403#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:08,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {403#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {403#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:08,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {384#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(<= main_~i~0 1)} assume true; {384#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {384#(<= main_~i~0 1)} assume !(~i~0 < 100000); {382#false} is VALID [2018-11-14 16:57:08,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#false} havoc ~x~0;~x~0 := 0; {382#false} is VALID [2018-11-14 16:57:08,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#false} assume true; {382#false} is VALID [2018-11-14 16:57:08,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {382#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {382#false} is VALID [2018-11-14 16:57:08,045 INFO L256 TraceCheckUtils]: 15: Hoare triple {382#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {382#false} is VALID [2018-11-14 16:57:08,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-14 16:57:08,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {382#false} assume ~cond == 0; {382#false} is VALID [2018-11-14 16:57:08,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-14 16:57:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:08,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:57:08,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 16:57:08,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:08,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:57:08,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:57:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:57:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:57:08,110 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-14 16:57:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:08,360 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 16:57:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:57:08,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 16:57:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:57:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 16:57:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:57:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 16:57:08,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 16:57:08,684 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:57:08,688 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:57:08,688 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:57:08,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:57:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:57:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-14 16:57:08,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:08,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-14 16:57:08,725 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-14 16:57:08,726 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-14 16:57:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:08,729 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-14 16:57:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 16:57:08,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:08,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-14 16:57:08,730 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-14 16:57:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:08,734 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-14 16:57:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 16:57:08,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:08,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:08,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:08,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:57:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-14 16:57:08,738 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 19 [2018-11-14 16:57:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:08,738 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-14 16:57:08,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:57:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 16:57:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:57:08,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:08,740 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:08,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:08,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 385699328, now seen corresponding path program 2 times [2018-11-14 16:57:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:08,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:08,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2018-11-14 16:57:08,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {631#true} is VALID [2018-11-14 16:57:08,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {631#true} assume true; {631#true} is VALID [2018-11-14 16:57:08,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} #73#return; {631#true} is VALID [2018-11-14 16:57:08,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {631#true} call #t~ret7 := main(); {631#true} is VALID [2018-11-14 16:57:08,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {631#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {633#(= main_~i~0 0)} is VALID [2018-11-14 16:57:08,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {633#(= main_~i~0 0)} assume true; {633#(= main_~i~0 0)} is VALID [2018-11-14 16:57:08,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {633#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {633#(= main_~i~0 0)} is VALID [2018-11-14 16:57:08,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {633#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {633#(= main_~i~0 0)} is VALID [2018-11-14 16:57:08,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {633#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {634#(<= main_~i~0 1)} assume true; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {634#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {634#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:08,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {634#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {635#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:08,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 2)} assume true; {635#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:08,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 2)} assume !(~i~0 < 100000); {632#false} is VALID [2018-11-14 16:57:08,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {632#false} havoc ~x~0;~x~0 := 0; {632#false} is VALID [2018-11-14 16:57:08,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#false} assume true; {632#false} is VALID [2018-11-14 16:57:08,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {632#false} is VALID [2018-11-14 16:57:08,896 INFO L256 TraceCheckUtils]: 19: Hoare triple {632#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {632#false} is VALID [2018-11-14 16:57:08,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2018-11-14 16:57:08,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {632#false} assume ~cond == 0; {632#false} is VALID [2018-11-14 16:57:08,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {632#false} assume !false; {632#false} is VALID [2018-11-14 16:57:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:08,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:08,900 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:57:08,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:57:08,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:57:08,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:08,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:09,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2018-11-14 16:57:09,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {631#true} is VALID [2018-11-14 16:57:09,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {631#true} assume true; {631#true} is VALID [2018-11-14 16:57:09,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} #73#return; {631#true} is VALID [2018-11-14 16:57:09,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {631#true} call #t~ret7 := main(); {631#true} is VALID [2018-11-14 16:57:09,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {631#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {654#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {654#(<= main_~i~0 0)} assume true; {654#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {654#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {654#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {634#(<= main_~i~0 1)} assume true; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {634#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {634#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {634#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {634#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {635#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 2)} assume true; {635#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 2)} assume !(~i~0 < 100000); {632#false} is VALID [2018-11-14 16:57:09,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {632#false} havoc ~x~0;~x~0 := 0; {632#false} is VALID [2018-11-14 16:57:09,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#false} assume true; {632#false} is VALID [2018-11-14 16:57:09,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {632#false} is VALID [2018-11-14 16:57:09,097 INFO L256 TraceCheckUtils]: 19: Hoare triple {632#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {632#false} is VALID [2018-11-14 16:57:09,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2018-11-14 16:57:09,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {632#false} assume ~cond == 0; {632#false} is VALID [2018-11-14 16:57:09,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {632#false} assume !false; {632#false} is VALID [2018-11-14 16:57:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:09,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:09,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:57:09,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 16:57:09,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:09,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:57:09,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:09,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:57:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:57:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:57:09,157 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-11-14 16:57:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:09,345 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-14 16:57:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:57:09,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 16:57:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:57:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-14 16:57:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:57:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-14 16:57:09,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2018-11-14 16:57:09,438 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:57:09,440 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:57:09,441 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:57:09,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:57:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:57:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-14 16:57:09,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:09,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-14 16:57:09,466 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-14 16:57:09,466 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-14 16:57:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:09,469 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-14 16:57:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-14 16:57:09,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:09,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:09,472 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-14 16:57:09,472 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-14 16:57:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:09,475 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-14 16:57:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-14 16:57:09,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:09,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:09,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:09,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:57:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-14 16:57:09,479 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2018-11-14 16:57:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:09,480 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-14 16:57:09,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:57:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-14 16:57:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:57:09,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:09,481 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:09,481 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:09,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1088749847, now seen corresponding path program 3 times [2018-11-14 16:57:09,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:09,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:09,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:09,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-14 16:57:09,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-14 16:57:09,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-14 16:57:09,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #73#return; {912#true} is VALID [2018-11-14 16:57:09,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret7 := main(); {912#true} is VALID [2018-11-14 16:57:09,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {914#(= main_~i~0 0)} is VALID [2018-11-14 16:57:09,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(= main_~i~0 0)} assume true; {914#(= main_~i~0 0)} is VALID [2018-11-14 16:57:09,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {914#(= main_~i~0 0)} is VALID [2018-11-14 16:57:09,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {914#(= main_~i~0 0)} is VALID [2018-11-14 16:57:09,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 1)} assume true; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 2)} assume true; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {917#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:09,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#(<= main_~i~0 3)} assume true; {917#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:09,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {917#(<= main_~i~0 3)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-14 16:57:09,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-14 16:57:09,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {913#false} assume true; {913#false} is VALID [2018-11-14 16:57:09,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {913#false} is VALID [2018-11-14 16:57:09,678 INFO L256 TraceCheckUtils]: 23: Hoare triple {913#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {913#false} is VALID [2018-11-14 16:57:09,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-14 16:57:09,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {913#false} assume ~cond == 0; {913#false} is VALID [2018-11-14 16:57:09,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-14 16:57:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:09,682 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:57:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:57:09,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:57:09,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:09,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:09,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-14 16:57:09,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-14 16:57:09,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-14 16:57:09,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #73#return; {912#true} is VALID [2018-11-14 16:57:09,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret7 := main(); {912#true} is VALID [2018-11-14 16:57:09,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {936#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {936#(<= main_~i~0 0)} assume true; {936#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {936#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {936#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {936#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {936#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:09,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {936#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 1)} assume true; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {915#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:09,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 2)} assume true; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {916#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:09,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {917#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:09,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#(<= main_~i~0 3)} assume true; {917#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:09,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {917#(<= main_~i~0 3)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-14 16:57:09,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-14 16:57:09,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {913#false} assume true; {913#false} is VALID [2018-11-14 16:57:09,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {913#false} is VALID [2018-11-14 16:57:09,818 INFO L256 TraceCheckUtils]: 23: Hoare triple {913#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {913#false} is VALID [2018-11-14 16:57:09,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-14 16:57:09,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {913#false} assume ~cond == 0; {913#false} is VALID [2018-11-14 16:57:09,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-14 16:57:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:09,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:57:09,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 16:57:09,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:09,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:57:09,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:09,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:57:09,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:57:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:57:09,900 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 7 states. [2018-11-14 16:57:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:10,276 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-14 16:57:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:57:10,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 16:57:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:57:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-14 16:57:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:57:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-14 16:57:10,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-14 16:57:10,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:10,436 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:57:10,436 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:57:10,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:57:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:57:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-14 16:57:10,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:10,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-14 16:57:10,457 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-14 16:57:10,457 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-14 16:57:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:10,459 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 16:57:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 16:57:10,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:10,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:10,460 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-14 16:57:10,461 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-14 16:57:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:10,463 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 16:57:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 16:57:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:10,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:10,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:10,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:57:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 16:57:10,468 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 27 [2018-11-14 16:57:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:10,468 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 16:57:10,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:57:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 16:57:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:57:10,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:10,469 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:10,470 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:10,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash -83930962, now seen corresponding path program 4 times [2018-11-14 16:57:10,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:10,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:10,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {1224#true} call ULTIMATE.init(); {1224#true} is VALID [2018-11-14 16:57:10,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {1224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1224#true} is VALID [2018-11-14 16:57:10,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {1224#true} assume true; {1224#true} is VALID [2018-11-14 16:57:10,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} #73#return; {1224#true} is VALID [2018-11-14 16:57:10,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {1224#true} call #t~ret7 := main(); {1224#true} is VALID [2018-11-14 16:57:10,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {1224#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1226#(= main_~i~0 0)} is VALID [2018-11-14 16:57:10,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#(= main_~i~0 0)} assume true; {1226#(= main_~i~0 0)} is VALID [2018-11-14 16:57:10,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1226#(= main_~i~0 0)} is VALID [2018-11-14 16:57:10,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1226#(= main_~i~0 0)} is VALID [2018-11-14 16:57:10,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {1227#(<= main_~i~0 1)} assume true; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {1227#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {1227#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {1227#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(<= main_~i~0 2)} assume true; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {1228#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {1228#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {1228#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#(<= main_~i~0 3)} assume true; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1230#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:10,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {1230#(<= main_~i~0 4)} assume true; {1230#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:10,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {1230#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1225#false} is VALID [2018-11-14 16:57:10,638 INFO L273 TraceCheckUtils]: 24: Hoare triple {1225#false} havoc ~x~0;~x~0 := 0; {1225#false} is VALID [2018-11-14 16:57:10,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {1225#false} assume true; {1225#false} is VALID [2018-11-14 16:57:10,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {1225#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1225#false} is VALID [2018-11-14 16:57:10,640 INFO L256 TraceCheckUtils]: 27: Hoare triple {1225#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1225#false} is VALID [2018-11-14 16:57:10,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {1225#false} ~cond := #in~cond; {1225#false} is VALID [2018-11-14 16:57:10,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {1225#false} assume ~cond == 0; {1225#false} is VALID [2018-11-14 16:57:10,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {1225#false} assume !false; {1225#false} is VALID [2018-11-14 16:57:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:10,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:10,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:57:10,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:57:10,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:10,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:10,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {1224#true} call ULTIMATE.init(); {1224#true} is VALID [2018-11-14 16:57:10,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {1224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1224#true} is VALID [2018-11-14 16:57:10,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {1224#true} assume true; {1224#true} is VALID [2018-11-14 16:57:10,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} #73#return; {1224#true} is VALID [2018-11-14 16:57:10,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {1224#true} call #t~ret7 := main(); {1224#true} is VALID [2018-11-14 16:57:10,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {1224#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1249#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:10,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {1249#(<= main_~i~0 0)} assume true; {1249#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:10,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {1249#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1249#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:10,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {1249#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1249#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:10,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {1249#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {1227#(<= main_~i~0 1)} assume true; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {1227#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {1227#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1227#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:10,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1227#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(<= main_~i~0 2)} assume true; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {1228#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {1228#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1228#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:10,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {1228#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#(<= main_~i~0 3)} assume true; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1229#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:10,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1230#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {1230#(<= main_~i~0 4)} assume true; {1230#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,008 INFO L273 TraceCheckUtils]: 23: Hoare triple {1230#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1225#false} is VALID [2018-11-14 16:57:11,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {1225#false} havoc ~x~0;~x~0 := 0; {1225#false} is VALID [2018-11-14 16:57:11,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {1225#false} assume true; {1225#false} is VALID [2018-11-14 16:57:11,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {1225#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1225#false} is VALID [2018-11-14 16:57:11,009 INFO L256 TraceCheckUtils]: 27: Hoare triple {1225#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1225#false} is VALID [2018-11-14 16:57:11,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {1225#false} ~cond := #in~cond; {1225#false} is VALID [2018-11-14 16:57:11,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {1225#false} assume ~cond == 0; {1225#false} is VALID [2018-11-14 16:57:11,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {1225#false} assume !false; {1225#false} is VALID [2018-11-14 16:57:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:11,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:57:11,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 16:57:11,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:11,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:57:11,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:11,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:57:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:57:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:57:11,073 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 8 states. [2018-11-14 16:57:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:11,321 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-14 16:57:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:57:11,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 16:57:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:57:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 16:57:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:57:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-14 16:57:11,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-14 16:57:11,413 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:57:11,415 INFO L225 Difference]: With dead ends: 66 [2018-11-14 16:57:11,416 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 16:57:11,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:57:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 16:57:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-14 16:57:11,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:11,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-14 16:57:11,438 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-14 16:57:11,438 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-14 16:57:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:11,440 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-14 16:57:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-14 16:57:11,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:11,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:11,442 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-14 16:57:11,442 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-14 16:57:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:11,444 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-14 16:57:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-14 16:57:11,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:11,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:11,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:11,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 16:57:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-14 16:57:11,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 31 [2018-11-14 16:57:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:11,448 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-14 16:57:11,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:57:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 16:57:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:57:11,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:11,450 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:11,450 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:11,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2041183429, now seen corresponding path program 5 times [2018-11-14 16:57:11,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:11,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:11,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:11,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:11,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:11,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-14 16:57:11,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1567#true} is VALID [2018-11-14 16:57:11,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-14 16:57:11,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #73#return; {1567#true} is VALID [2018-11-14 16:57:11,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret7 := main(); {1567#true} is VALID [2018-11-14 16:57:11,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1569#(= main_~i~0 0)} is VALID [2018-11-14 16:57:11,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {1569#(= main_~i~0 0)} assume true; {1569#(= main_~i~0 0)} is VALID [2018-11-14 16:57:11,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1569#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1569#(= main_~i~0 0)} is VALID [2018-11-14 16:57:11,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {1569#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1569#(= main_~i~0 0)} is VALID [2018-11-14 16:57:11,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:11,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 1)} assume true; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:11,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:11,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:11,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:11,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(<= main_~i~0 2)} assume true; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:11,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:11,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:11,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:11,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~i~0 3)} assume true; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:11,620 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:11,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:11,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {1572#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~i~0 4)} assume true; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {1573#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:11,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {1573#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1574#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:11,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {1574#(<= main_~i~0 5)} assume true; {1574#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:11,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {1574#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1568#false} is VALID [2018-11-14 16:57:11,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {1568#false} havoc ~x~0;~x~0 := 0; {1568#false} is VALID [2018-11-14 16:57:11,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {1568#false} assume true; {1568#false} is VALID [2018-11-14 16:57:11,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {1568#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1568#false} is VALID [2018-11-14 16:57:11,642 INFO L256 TraceCheckUtils]: 31: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1568#false} is VALID [2018-11-14 16:57:11,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-14 16:57:11,643 INFO L273 TraceCheckUtils]: 33: Hoare triple {1568#false} assume ~cond == 0; {1568#false} is VALID [2018-11-14 16:57:11,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-14 16:57:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:11,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:11,645 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:57:11,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:57:11,727 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:57:11,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:11,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:12,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-14 16:57:12,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1567#true} is VALID [2018-11-14 16:57:12,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-14 16:57:12,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #73#return; {1567#true} is VALID [2018-11-14 16:57:12,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret7 := main(); {1567#true} is VALID [2018-11-14 16:57:12,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1593#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:12,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {1593#(<= main_~i~0 0)} assume true; {1593#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:12,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {1593#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1593#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:12,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {1593#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1593#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:12,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {1593#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:12,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 1)} assume true; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:12,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:12,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1570#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:12,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:12,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(<= main_~i~0 2)} assume true; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:12,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:12,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1571#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:12,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:12,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~i~0 3)} assume true; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:12,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:12,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1572#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:12,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {1572#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:12,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~i~0 4)} assume true; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:12,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:12,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {1573#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1573#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:12,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {1573#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1574#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:12,069 INFO L273 TraceCheckUtils]: 26: Hoare triple {1574#(<= main_~i~0 5)} assume true; {1574#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:12,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {1574#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1568#false} is VALID [2018-11-14 16:57:12,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {1568#false} havoc ~x~0;~x~0 := 0; {1568#false} is VALID [2018-11-14 16:57:12,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {1568#false} assume true; {1568#false} is VALID [2018-11-14 16:57:12,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {1568#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1568#false} is VALID [2018-11-14 16:57:12,071 INFO L256 TraceCheckUtils]: 31: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1568#false} is VALID [2018-11-14 16:57:12,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-14 16:57:12,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {1568#false} assume ~cond == 0; {1568#false} is VALID [2018-11-14 16:57:12,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-14 16:57:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:12,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:57:12,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 16:57:12,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:12,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:57:12,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:12,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:57:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:57:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:57:12,160 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-14 16:57:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:12,646 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-14 16:57:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:57:12,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 16:57:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:57:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-14 16:57:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:57:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-14 16:57:12,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-14 16:57:12,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:12,896 INFO L225 Difference]: With dead ends: 70 [2018-11-14 16:57:12,896 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 16:57:12,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:57:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 16:57:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-14 16:57:12,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:12,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-14 16:57:12,924 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-14 16:57:12,924 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-14 16:57:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:12,927 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 16:57:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-14 16:57:12,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:12,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:12,927 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-14 16:57:12,928 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-14 16:57:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:12,930 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 16:57:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-14 16:57:12,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:12,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:12,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:12,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:57:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-14 16:57:12,933 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 35 [2018-11-14 16:57:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:12,934 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-14 16:57:12,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:57:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 16:57:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:57:12,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:12,935 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:12,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:12,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 207799644, now seen corresponding path program 6 times [2018-11-14 16:57:12,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:12,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:12,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:13,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-14 16:57:13,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-14 16:57:13,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-14 16:57:13,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #73#return; {1941#true} is VALID [2018-11-14 16:57:13,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret7 := main(); {1941#true} is VALID [2018-11-14 16:57:13,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1943#(= main_~i~0 0)} is VALID [2018-11-14 16:57:13,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {1943#(= main_~i~0 0)} assume true; {1943#(= main_~i~0 0)} is VALID [2018-11-14 16:57:13,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1943#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1943#(= main_~i~0 0)} is VALID [2018-11-14 16:57:13,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {1943#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1943#(= main_~i~0 0)} is VALID [2018-11-14 16:57:13,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {1943#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {1944#(<= main_~i~0 1)} assume true; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {1944#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {1945#(<= main_~i~0 2)} assume true; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 3)} assume true; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {1946#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {1947#(<= main_~i~0 4)} assume true; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {1947#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {1948#(<= main_~i~0 5)} assume true; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {1948#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:13,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#(<= main_~i~0 6)} assume true; {1949#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:13,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-14 16:57:13,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {1942#false} havoc ~x~0;~x~0 := 0; {1942#false} is VALID [2018-11-14 16:57:13,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {1942#false} assume true; {1942#false} is VALID [2018-11-14 16:57:13,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {1942#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1942#false} is VALID [2018-11-14 16:57:13,540 INFO L256 TraceCheckUtils]: 35: Hoare triple {1942#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1942#false} is VALID [2018-11-14 16:57:13,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-14 16:57:13,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {1942#false} assume ~cond == 0; {1942#false} is VALID [2018-11-14 16:57:13,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-14 16:57:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:13,543 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:57:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:57:13,602 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:57:13,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:13,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:13,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-14 16:57:13,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-14 16:57:13,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-14 16:57:13,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #73#return; {1941#true} is VALID [2018-11-14 16:57:13,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret7 := main(); {1941#true} is VALID [2018-11-14 16:57:13,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1968#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:13,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {1968#(<= main_~i~0 0)} assume true; {1968#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:13,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {1968#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1968#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:13,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {1968#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1968#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:13,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {1968#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {1944#(<= main_~i~0 1)} assume true; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {1944#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1944#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:13,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {1945#(<= main_~i~0 2)} assume true; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1945#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:13,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 3)} assume true; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {1946#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1946#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:13,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {1947#(<= main_~i~0 4)} assume true; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {1947#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1947#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:13,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {1948#(<= main_~i~0 5)} assume true; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {1948#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1948#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:13,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:13,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#(<= main_~i~0 6)} assume true; {1949#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:13,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-14 16:57:13,786 INFO L273 TraceCheckUtils]: 32: Hoare triple {1942#false} havoc ~x~0;~x~0 := 0; {1942#false} is VALID [2018-11-14 16:57:13,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {1942#false} assume true; {1942#false} is VALID [2018-11-14 16:57:13,787 INFO L273 TraceCheckUtils]: 34: Hoare triple {1942#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {1942#false} is VALID [2018-11-14 16:57:13,787 INFO L256 TraceCheckUtils]: 35: Hoare triple {1942#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1942#false} is VALID [2018-11-14 16:57:13,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-14 16:57:13,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {1942#false} assume ~cond == 0; {1942#false} is VALID [2018-11-14 16:57:13,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-14 16:57:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:13,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:13,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:57:13,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 16:57:13,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:13,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:57:13,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:13,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:57:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:57:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:57:13,948 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 10 states. [2018-11-14 16:57:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:14,700 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2018-11-14 16:57:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:57:14,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 16:57:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:57:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2018-11-14 16:57:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:57:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2018-11-14 16:57:14,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 88 transitions. [2018-11-14 16:57:14,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:14,815 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:57:14,815 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:57:14,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:57:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:57:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-14 16:57:14,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:14,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-14 16:57:14,847 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-14 16:57:14,847 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-14 16:57:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:14,849 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 16:57:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 16:57:14,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:14,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:14,850 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-14 16:57:14,850 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-14 16:57:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:14,852 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 16:57:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 16:57:14,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:14,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:14,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:14,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 16:57:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-14 16:57:14,855 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 39 [2018-11-14 16:57:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:14,855 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-14 16:57:14,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:57:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-14 16:57:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 16:57:14,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:14,856 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:14,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:14,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1916310925, now seen corresponding path program 7 times [2018-11-14 16:57:14,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:14,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:14,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:15,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {2346#true} call ULTIMATE.init(); {2346#true} is VALID [2018-11-14 16:57:15,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {2346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2346#true} is VALID [2018-11-14 16:57:15,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {2346#true} assume true; {2346#true} is VALID [2018-11-14 16:57:15,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2346#true} {2346#true} #73#return; {2346#true} is VALID [2018-11-14 16:57:15,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {2346#true} call #t~ret7 := main(); {2346#true} is VALID [2018-11-14 16:57:15,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {2346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2348#(= main_~i~0 0)} is VALID [2018-11-14 16:57:15,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {2348#(= main_~i~0 0)} assume true; {2348#(= main_~i~0 0)} is VALID [2018-11-14 16:57:15,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {2348#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2348#(= main_~i~0 0)} is VALID [2018-11-14 16:57:15,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {2348#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2348#(= main_~i~0 0)} is VALID [2018-11-14 16:57:15,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {2348#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {2349#(<= main_~i~0 1)} assume true; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {2349#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {2349#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {2349#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {2350#(<= main_~i~0 2)} assume true; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {2350#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 3)} assume true; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {2351#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {2351#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {2352#(<= main_~i~0 4)} assume true; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {2352#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {2352#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {2352#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {2353#(<= main_~i~0 5)} assume true; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {2353#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {2353#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {2353#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {2354#(<= main_~i~0 6)} assume true; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {2354#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {2354#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {2354#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2355#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:15,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#(<= main_~i~0 7)} assume true; {2355#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:15,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2347#false} is VALID [2018-11-14 16:57:15,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {2347#false} havoc ~x~0;~x~0 := 0; {2347#false} is VALID [2018-11-14 16:57:15,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {2347#false} assume true; {2347#false} is VALID [2018-11-14 16:57:15,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {2347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {2347#false} is VALID [2018-11-14 16:57:15,330 INFO L256 TraceCheckUtils]: 39: Hoare triple {2347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2347#false} is VALID [2018-11-14 16:57:15,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {2347#false} ~cond := #in~cond; {2347#false} is VALID [2018-11-14 16:57:15,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {2347#false} assume ~cond == 0; {2347#false} is VALID [2018-11-14 16:57:15,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {2347#false} assume !false; {2347#false} is VALID [2018-11-14 16:57:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:15,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:15,332 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:57:15,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:15,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:15,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {2346#true} call ULTIMATE.init(); {2346#true} is VALID [2018-11-14 16:57:15,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {2346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2346#true} is VALID [2018-11-14 16:57:15,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {2346#true} assume true; {2346#true} is VALID [2018-11-14 16:57:15,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2346#true} {2346#true} #73#return; {2346#true} is VALID [2018-11-14 16:57:15,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {2346#true} call #t~ret7 := main(); {2346#true} is VALID [2018-11-14 16:57:15,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {2346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2374#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:15,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {2374#(<= main_~i~0 0)} assume true; {2374#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:15,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2374#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:15,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {2374#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2374#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:15,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {2374#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {2349#(<= main_~i~0 1)} assume true; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {2349#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {2349#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2349#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:15,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {2349#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {2350#(<= main_~i~0 2)} assume true; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {2350#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2350#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:15,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 3)} assume true; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {2351#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2351#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:15,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {2351#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {2352#(<= main_~i~0 4)} assume true; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {2352#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {2352#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2352#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:15,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {2352#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {2353#(<= main_~i~0 5)} assume true; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {2353#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {2353#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2353#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:15,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {2353#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {2354#(<= main_~i~0 6)} assume true; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {2354#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {2354#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2354#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:15,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {2354#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2355#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:15,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#(<= main_~i~0 7)} assume true; {2355#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:15,556 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2347#false} is VALID [2018-11-14 16:57:15,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {2347#false} havoc ~x~0;~x~0 := 0; {2347#false} is VALID [2018-11-14 16:57:15,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {2347#false} assume true; {2347#false} is VALID [2018-11-14 16:57:15,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {2347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {2347#false} is VALID [2018-11-14 16:57:15,557 INFO L256 TraceCheckUtils]: 39: Hoare triple {2347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2347#false} is VALID [2018-11-14 16:57:15,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {2347#false} ~cond := #in~cond; {2347#false} is VALID [2018-11-14 16:57:15,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {2347#false} assume ~cond == 0; {2347#false} is VALID [2018-11-14 16:57:15,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {2347#false} assume !false; {2347#false} is VALID [2018-11-14 16:57:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:15,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:15,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:57:15,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 16:57:15,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:15,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:57:15,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:15,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:57:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:57:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:57:15,635 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 11 states. [2018-11-14 16:57:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:16,040 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-14 16:57:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:57:16,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 16:57:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:57:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2018-11-14 16:57:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:57:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2018-11-14 16:57:16,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2018-11-14 16:57:16,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:16,144 INFO L225 Difference]: With dead ends: 78 [2018-11-14 16:57:16,145 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:57:16,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:57:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:57:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-14 16:57:16,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:16,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-14 16:57:16,165 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-14 16:57:16,165 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-14 16:57:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:16,167 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 16:57:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 16:57:16,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:16,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:16,168 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-14 16:57:16,169 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-14 16:57:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:16,171 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 16:57:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 16:57:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:16,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:16,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:16,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:57:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-14 16:57:16,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 43 [2018-11-14 16:57:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:16,175 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-14 16:57:16,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:57:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 16:57:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 16:57:16,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:16,176 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:16,176 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:16,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -745165814, now seen corresponding path program 8 times [2018-11-14 16:57:16,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:16,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:16,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {2782#true} call ULTIMATE.init(); {2782#true} is VALID [2018-11-14 16:57:16,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {2782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2782#true} is VALID [2018-11-14 16:57:16,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {2782#true} assume true; {2782#true} is VALID [2018-11-14 16:57:16,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2782#true} {2782#true} #73#return; {2782#true} is VALID [2018-11-14 16:57:16,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {2782#true} call #t~ret7 := main(); {2782#true} is VALID [2018-11-14 16:57:16,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {2782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2784#(= main_~i~0 0)} is VALID [2018-11-14 16:57:16,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {2784#(= main_~i~0 0)} assume true; {2784#(= main_~i~0 0)} is VALID [2018-11-14 16:57:16,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {2784#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2784#(= main_~i~0 0)} is VALID [2018-11-14 16:57:16,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {2784#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2784#(= main_~i~0 0)} is VALID [2018-11-14 16:57:16,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {2784#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {2785#(<= main_~i~0 1)} assume true; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {2785#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {2786#(<= main_~i~0 2)} assume true; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 3)} assume true; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {2787#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {2787#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {2788#(<= main_~i~0 4)} assume true; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {2788#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {2788#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {2788#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {2789#(<= main_~i~0 5)} assume true; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {2789#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {2789#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {2789#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {2790#(<= main_~i~0 6)} assume true; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {2790#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {2790#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {2790#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {2791#(<= main_~i~0 7)} assume true; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {2791#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {2791#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {2791#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2792#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:16,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {2792#(<= main_~i~0 8)} assume true; {2792#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:16,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {2792#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2783#false} is VALID [2018-11-14 16:57:16,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {2783#false} havoc ~x~0;~x~0 := 0; {2783#false} is VALID [2018-11-14 16:57:16,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {2783#false} assume true; {2783#false} is VALID [2018-11-14 16:57:16,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {2783#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {2783#false} is VALID [2018-11-14 16:57:16,409 INFO L256 TraceCheckUtils]: 43: Hoare triple {2783#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2783#false} is VALID [2018-11-14 16:57:16,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {2783#false} ~cond := #in~cond; {2783#false} is VALID [2018-11-14 16:57:16,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {2783#false} assume ~cond == 0; {2783#false} is VALID [2018-11-14 16:57:16,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {2783#false} assume !false; {2783#false} is VALID [2018-11-14 16:57:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:16,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:16,411 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:57:16,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:57:16,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:57:16,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:16,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:16,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {2782#true} call ULTIMATE.init(); {2782#true} is VALID [2018-11-14 16:57:16,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {2782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2782#true} is VALID [2018-11-14 16:57:16,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {2782#true} assume true; {2782#true} is VALID [2018-11-14 16:57:16,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2782#true} {2782#true} #73#return; {2782#true} is VALID [2018-11-14 16:57:16,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {2782#true} call #t~ret7 := main(); {2782#true} is VALID [2018-11-14 16:57:16,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {2782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2811#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:16,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {2811#(<= main_~i~0 0)} assume true; {2811#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:16,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {2811#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2811#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:16,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {2811#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2811#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:16,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {2811#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {2785#(<= main_~i~0 1)} assume true; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2785#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:16,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {2785#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {2786#(<= main_~i~0 2)} assume true; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2786#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:16,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 3)} assume true; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {2787#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2787#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:16,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {2787#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {2788#(<= main_~i~0 4)} assume true; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {2788#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {2788#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2788#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:16,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {2788#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {2789#(<= main_~i~0 5)} assume true; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {2789#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {2789#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2789#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:16,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {2789#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {2790#(<= main_~i~0 6)} assume true; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {2790#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {2790#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2790#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:16,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {2790#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,639 INFO L273 TraceCheckUtils]: 34: Hoare triple {2791#(<= main_~i~0 7)} assume true; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {2791#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {2791#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2791#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:16,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {2791#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2792#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:16,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {2792#(<= main_~i~0 8)} assume true; {2792#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:16,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {2792#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2783#false} is VALID [2018-11-14 16:57:16,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {2783#false} havoc ~x~0;~x~0 := 0; {2783#false} is VALID [2018-11-14 16:57:16,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {2783#false} assume true; {2783#false} is VALID [2018-11-14 16:57:16,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {2783#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {2783#false} is VALID [2018-11-14 16:57:16,643 INFO L256 TraceCheckUtils]: 43: Hoare triple {2783#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2783#false} is VALID [2018-11-14 16:57:16,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {2783#false} ~cond := #in~cond; {2783#false} is VALID [2018-11-14 16:57:16,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {2783#false} assume ~cond == 0; {2783#false} is VALID [2018-11-14 16:57:16,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {2783#false} assume !false; {2783#false} is VALID [2018-11-14 16:57:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:57:16,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-14 16:57:16,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:16,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:57:16,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:16,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:57:16,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:57:16,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:57:16,815 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2018-11-14 16:57:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:17,248 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-14 16:57:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:57:17,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-14 16:57:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:57:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-14 16:57:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:57:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-14 16:57:17,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2018-11-14 16:57:17,422 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:57:17,424 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:57:17,424 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 16:57:17,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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:57:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 16:57:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 16:57:17,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:17,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 16:57:17,457 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 16:57:17,457 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 16:57:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:17,459 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 16:57:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 16:57:17,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:17,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:17,459 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 16:57:17,460 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 16:57:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:17,461 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 16:57:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 16:57:17,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:17,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:17,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:17,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 16:57:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2018-11-14 16:57:17,463 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 47 [2018-11-14 16:57:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:17,464 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2018-11-14 16:57:17,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:57:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-14 16:57:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:57:17,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:17,465 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:17,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:17,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 514542113, now seen corresponding path program 9 times [2018-11-14 16:57:17,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:17,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:17,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:17,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:17,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {3249#true} call ULTIMATE.init(); {3249#true} is VALID [2018-11-14 16:57:17,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {3249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3249#true} is VALID [2018-11-14 16:57:17,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {3249#true} assume true; {3249#true} is VALID [2018-11-14 16:57:17,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3249#true} {3249#true} #73#return; {3249#true} is VALID [2018-11-14 16:57:17,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {3249#true} call #t~ret7 := main(); {3249#true} is VALID [2018-11-14 16:57:17,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {3249#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3251#(= main_~i~0 0)} is VALID [2018-11-14 16:57:17,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {3251#(= main_~i~0 0)} assume true; {3251#(= main_~i~0 0)} is VALID [2018-11-14 16:57:17,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {3251#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3251#(= main_~i~0 0)} is VALID [2018-11-14 16:57:17,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {3251#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3251#(= main_~i~0 0)} is VALID [2018-11-14 16:57:17,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {3251#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {3252#(<= main_~i~0 1)} assume true; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {3252#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {3252#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {3252#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {3253#(<= main_~i~0 2)} assume true; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {3253#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {3253#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {3253#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {3254#(<= main_~i~0 3)} assume true; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {3254#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {3254#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {3254#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(<= main_~i~0 4)} assume true; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {3255#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {3255#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {3255#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {3256#(<= main_~i~0 5)} assume true; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {3256#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {3256#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {3256#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {3257#(<= main_~i~0 6)} assume true; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {3257#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {3257#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {3257#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {3258#(<= main_~i~0 7)} assume true; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {3258#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {3258#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {3258#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:17,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {3259#(<= main_~i~0 8)} assume true; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:17,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {3259#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:17,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {3259#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:17,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {3259#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3260#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:17,751 INFO L273 TraceCheckUtils]: 42: Hoare triple {3260#(<= main_~i~0 9)} assume true; {3260#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:17,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {3260#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3250#false} is VALID [2018-11-14 16:57:17,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {3250#false} havoc ~x~0;~x~0 := 0; {3250#false} is VALID [2018-11-14 16:57:17,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {3250#false} assume true; {3250#false} is VALID [2018-11-14 16:57:17,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {3250#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {3250#false} is VALID [2018-11-14 16:57:17,756 INFO L256 TraceCheckUtils]: 47: Hoare triple {3250#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3250#false} is VALID [2018-11-14 16:57:17,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {3250#false} ~cond := #in~cond; {3250#false} is VALID [2018-11-14 16:57:17,756 INFO L273 TraceCheckUtils]: 49: Hoare triple {3250#false} assume ~cond == 0; {3250#false} is VALID [2018-11-14 16:57:17,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {3250#false} assume !false; {3250#false} is VALID [2018-11-14 16:57:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:17,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:17,760 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:57:17,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:57:17,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:57:17,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:17,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:17,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {3249#true} call ULTIMATE.init(); {3249#true} is VALID [2018-11-14 16:57:17,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {3249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3249#true} is VALID [2018-11-14 16:57:17,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {3249#true} assume true; {3249#true} is VALID [2018-11-14 16:57:17,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3249#true} {3249#true} #73#return; {3249#true} is VALID [2018-11-14 16:57:17,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {3249#true} call #t~ret7 := main(); {3249#true} is VALID [2018-11-14 16:57:17,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {3249#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3279#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:17,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {3279#(<= main_~i~0 0)} assume true; {3279#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:17,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {3279#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3279#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:17,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {3279#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3279#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:17,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {3279#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {3252#(<= main_~i~0 1)} assume true; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {3252#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {3252#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3252#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:17,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {3252#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {3253#(<= main_~i~0 2)} assume true; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {3253#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {3253#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3253#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:17,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {3253#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {3254#(<= main_~i~0 3)} assume true; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {3254#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {3254#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3254#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:17,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {3254#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(<= main_~i~0 4)} assume true; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {3255#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {3255#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3255#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:17,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {3255#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {3256#(<= main_~i~0 5)} assume true; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {3256#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {3256#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3256#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:17,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {3256#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {3257#(<= main_~i~0 6)} assume true; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {3257#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,997 INFO L273 TraceCheckUtils]: 32: Hoare triple {3257#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3257#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:17,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {3257#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {3258#(<= main_~i~0 7)} assume true; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:17,999 INFO L273 TraceCheckUtils]: 35: Hoare triple {3258#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {3258#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3258#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {3258#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {3259#(<= main_~i~0 8)} assume true; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {3259#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {3259#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3259#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {3259#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3260#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {3260#(<= main_~i~0 9)} assume true; {3260#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {3260#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3250#false} is VALID [2018-11-14 16:57:18,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {3250#false} havoc ~x~0;~x~0 := 0; {3250#false} is VALID [2018-11-14 16:57:18,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {3250#false} assume true; {3250#false} is VALID [2018-11-14 16:57:18,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {3250#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {3250#false} is VALID [2018-11-14 16:57:18,005 INFO L256 TraceCheckUtils]: 47: Hoare triple {3250#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3250#false} is VALID [2018-11-14 16:57:18,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {3250#false} ~cond := #in~cond; {3250#false} is VALID [2018-11-14 16:57:18,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {3250#false} assume ~cond == 0; {3250#false} is VALID [2018-11-14 16:57:18,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {3250#false} assume !false; {3250#false} is VALID [2018-11-14 16:57:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:18,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 16:57:18,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-14 16:57:18,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:18,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:57:18,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:18,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:57:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:57:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:57:18,085 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 13 states. [2018-11-14 16:57:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:18,457 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-11-14 16:57:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:57:18,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-14 16:57:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:57:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-14 16:57:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:57:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-14 16:57:18,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 103 transitions. [2018-11-14 16:57:18,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:18,557 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:57:18,558 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 16:57:18,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:57:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 16:57:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-14 16:57:18,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:18,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-14 16:57:18,575 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-14 16:57:18,575 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-14 16:57:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:18,577 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-14 16:57:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-14 16:57:18,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:18,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:18,578 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-14 16:57:18,578 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-14 16:57:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:18,580 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-14 16:57:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-14 16:57:18,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:18,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:18,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:18,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:57:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-14 16:57:18,583 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 51 [2018-11-14 16:57:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:18,583 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-14 16:57:18,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:57:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 16:57:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 16:57:18,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:18,584 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:18,584 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:18,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1962539848, now seen corresponding path program 10 times [2018-11-14 16:57:18,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:18,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:18,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:18,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:18,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-14 16:57:18,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-14 16:57:18,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-14 16:57:18,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #73#return; {3747#true} is VALID [2018-11-14 16:57:18,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret7 := main(); {3747#true} is VALID [2018-11-14 16:57:18,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3749#(= main_~i~0 0)} is VALID [2018-11-14 16:57:18,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~i~0 0)} assume true; {3749#(= main_~i~0 0)} is VALID [2018-11-14 16:57:18,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3749#(= main_~i~0 0)} is VALID [2018-11-14 16:57:18,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3749#(= main_~i~0 0)} is VALID [2018-11-14 16:57:18,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {3749#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:18,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {3750#(<= main_~i~0 1)} assume true; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:18,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {3750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:18,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {3750#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:18,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {3750#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:18,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {3751#(<= main_~i~0 2)} assume true; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:18,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {3751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:18,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {3751#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:18,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {3751#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:18,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {3752#(<= main_~i~0 3)} assume true; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:18,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {3752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:18,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {3752#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:18,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {3752#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:18,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {3753#(<= main_~i~0 4)} assume true; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:18,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {3753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:18,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {3753#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:18,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {3753#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:18,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {3754#(<= main_~i~0 5)} assume true; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:18,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {3754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:18,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {3754#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:18,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {3754#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:18,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {3755#(<= main_~i~0 6)} assume true; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:18,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {3755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:18,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {3755#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:18,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {3755#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {3756#(<= main_~i~0 7)} assume true; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {3756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:18,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#(<= main_~i~0 8)} assume true; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:18,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,817 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#(<= main_~i~0 9)} assume true; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,817 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,818 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:18,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3759#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:18,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {3759#(<= main_~i~0 10)} assume true; {3759#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:18,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {3759#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-14 16:57:18,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume true; {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L256 TraceCheckUtils]: 51: Hoare triple {3748#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} assume ~cond == 0; {3748#false} is VALID [2018-11-14 16:57:18,833 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-14 16:57:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:18,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:18,835 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:57:18,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:57:18,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:57:18,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:18,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:19,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-14 16:57:19,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-14 16:57:19,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-14 16:57:19,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #73#return; {3747#true} is VALID [2018-11-14 16:57:19,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret7 := main(); {3747#true} is VALID [2018-11-14 16:57:19,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3778#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:19,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {3778#(<= main_~i~0 0)} assume true; {3778#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:19,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {3778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3778#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:19,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {3778#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3778#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:19,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {3778#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:19,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {3750#(<= main_~i~0 1)} assume true; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:19,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {3750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:19,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {3750#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3750#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:19,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {3750#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:19,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {3751#(<= main_~i~0 2)} assume true; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:19,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {3751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:19,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {3751#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3751#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:19,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {3751#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:19,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {3752#(<= main_~i~0 3)} assume true; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:19,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {3752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:19,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {3752#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3752#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:19,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {3752#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:19,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {3753#(<= main_~i~0 4)} assume true; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:19,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {3753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:19,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {3753#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3753#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:19,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {3753#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:19,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {3754#(<= main_~i~0 5)} assume true; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:19,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {3754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:19,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {3754#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3754#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:19,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {3754#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:19,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {3755#(<= main_~i~0 6)} assume true; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:19,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {3755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:19,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {3755#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3755#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:19,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {3755#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:19,251 INFO L273 TraceCheckUtils]: 34: Hoare triple {3756#(<= main_~i~0 7)} assume true; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:19,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {3756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:19,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3756#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:19,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:19,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#(<= main_~i~0 8)} assume true; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:19,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:19,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3757#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:19,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:19,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#(<= main_~i~0 9)} assume true; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:19,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:19,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3758#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:19,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3759#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:19,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {3759#(<= main_~i~0 10)} assume true; {3759#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:19,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {3759#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-14 16:57:19,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-14 16:57:19,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume true; {3748#false} is VALID [2018-11-14 16:57:19,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {3748#false} is VALID [2018-11-14 16:57:19,260 INFO L256 TraceCheckUtils]: 51: Hoare triple {3748#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3748#false} is VALID [2018-11-14 16:57:19,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-14 16:57:19,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} assume ~cond == 0; {3748#false} is VALID [2018-11-14 16:57:19,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-14 16:57:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:19,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:19,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:57:19,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-14 16:57:19,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:19,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:57:19,358 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:57:19,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:57:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:57:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:57:19,360 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 14 states. [2018-11-14 16:57:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:19,722 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2018-11-14 16:57:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:57:19,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-14 16:57:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:57:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 16:57:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:57:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-14 16:57:19,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2018-11-14 16:57:19,863 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:57:19,865 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:57:19,865 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:57:19,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:57:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:57:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-14 16:57:19,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:19,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-14 16:57:19,895 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-14 16:57:19,895 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-14 16:57:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:19,897 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 16:57:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-14 16:57:19,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:19,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:19,899 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-14 16:57:19,899 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-14 16:57:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:19,901 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 16:57:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-14 16:57:19,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:19,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:19,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:19,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 16:57:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-14 16:57:19,904 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 55 [2018-11-14 16:57:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:19,905 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-14 16:57:19,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:57:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-14 16:57:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 16:57:19,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:19,906 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:19,906 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:19,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2143525839, now seen corresponding path program 11 times [2018-11-14 16:57:19,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:19,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:20,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2018-11-14 16:57:20,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4276#true} is VALID [2018-11-14 16:57:20,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2018-11-14 16:57:20,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #73#return; {4276#true} is VALID [2018-11-14 16:57:20,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret7 := main(); {4276#true} is VALID [2018-11-14 16:57:20,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4278#(= main_~i~0 0)} is VALID [2018-11-14 16:57:20,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {4278#(= main_~i~0 0)} assume true; {4278#(= main_~i~0 0)} is VALID [2018-11-14 16:57:20,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {4278#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4278#(= main_~i~0 0)} is VALID [2018-11-14 16:57:20,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {4278#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4278#(= main_~i~0 0)} is VALID [2018-11-14 16:57:20,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {4278#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {4279#(<= main_~i~0 1)} assume true; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {4279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {4280#(<= main_~i~0 2)} assume true; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {4280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {4280#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {4280#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {4281#(<= main_~i~0 3)} assume true; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {4281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {4281#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {4281#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {4282#(<= main_~i~0 4)} assume true; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {4282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {4282#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {4282#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(<= main_~i~0 5)} assume true; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {4283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {4283#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {4283#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {4284#(<= main_~i~0 6)} assume true; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {4284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {4284#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {4284#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {4285#(<= main_~i~0 7)} assume true; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {4285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {4285#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {4285#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {4286#(<= main_~i~0 8)} assume true; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {4286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {4286#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {4286#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {4287#(<= main_~i~0 9)} assume true; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {4287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {4287#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {4287#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {4288#(<= main_~i~0 10)} assume true; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {4288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {4288#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {4288#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4289#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:20,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {4289#(<= main_~i~0 11)} assume true; {4289#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:20,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4277#false} is VALID [2018-11-14 16:57:20,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {4277#false} havoc ~x~0;~x~0 := 0; {4277#false} is VALID [2018-11-14 16:57:20,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {4277#false} assume true; {4277#false} is VALID [2018-11-14 16:57:20,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {4277#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {4277#false} is VALID [2018-11-14 16:57:20,888 INFO L256 TraceCheckUtils]: 55: Hoare triple {4277#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4277#false} is VALID [2018-11-14 16:57:20,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {4277#false} ~cond := #in~cond; {4277#false} is VALID [2018-11-14 16:57:20,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {4277#false} assume ~cond == 0; {4277#false} is VALID [2018-11-14 16:57:20,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2018-11-14 16:57:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:20,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:20,894 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:57:20,902 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:57:20,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:57:20,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:21,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:21,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2018-11-14 16:57:21,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4276#true} is VALID [2018-11-14 16:57:21,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2018-11-14 16:57:21,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #73#return; {4276#true} is VALID [2018-11-14 16:57:21,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret7 := main(); {4276#true} is VALID [2018-11-14 16:57:21,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4308#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:21,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {4308#(<= main_~i~0 0)} assume true; {4308#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:21,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {4308#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4308#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:21,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {4308#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4308#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:21,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {4308#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:21,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {4279#(<= main_~i~0 1)} assume true; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:21,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {4279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:21,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4279#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:21,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:21,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {4280#(<= main_~i~0 2)} assume true; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:21,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {4280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:21,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {4280#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4280#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:21,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {4280#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:21,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {4281#(<= main_~i~0 3)} assume true; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:21,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {4281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:21,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {4281#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4281#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:21,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {4281#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:21,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {4282#(<= main_~i~0 4)} assume true; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:21,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {4282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:21,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {4282#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4282#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:21,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {4282#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:21,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(<= main_~i~0 5)} assume true; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:21,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {4283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:21,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {4283#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4283#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:21,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {4283#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:21,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {4284#(<= main_~i~0 6)} assume true; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:21,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {4284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:21,189 INFO L273 TraceCheckUtils]: 32: Hoare triple {4284#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4284#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:21,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {4284#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:21,190 INFO L273 TraceCheckUtils]: 34: Hoare triple {4285#(<= main_~i~0 7)} assume true; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:21,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {4285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:21,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {4285#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4285#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:21,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {4285#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:21,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {4286#(<= main_~i~0 8)} assume true; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:21,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {4286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:21,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {4286#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4286#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:21,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {4286#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:21,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {4287#(<= main_~i~0 9)} assume true; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:21,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {4287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:21,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {4287#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4287#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:21,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {4287#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:21,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {4288#(<= main_~i~0 10)} assume true; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:21,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {4288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:21,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {4288#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4288#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:21,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {4288#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4289#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:21,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {4289#(<= main_~i~0 11)} assume true; {4289#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:21,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4277#false} is VALID [2018-11-14 16:57:21,200 INFO L273 TraceCheckUtils]: 52: Hoare triple {4277#false} havoc ~x~0;~x~0 := 0; {4277#false} is VALID [2018-11-14 16:57:21,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {4277#false} assume true; {4277#false} is VALID [2018-11-14 16:57:21,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {4277#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {4277#false} is VALID [2018-11-14 16:57:21,200 INFO L256 TraceCheckUtils]: 55: Hoare triple {4277#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4277#false} is VALID [2018-11-14 16:57:21,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {4277#false} ~cond := #in~cond; {4277#false} is VALID [2018-11-14 16:57:21,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {4277#false} assume ~cond == 0; {4277#false} is VALID [2018-11-14 16:57:21,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2018-11-14 16:57:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:21,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:57:21,228 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-14 16:57:21,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:21,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:57:21,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:21,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:57:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:57:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:57:21,290 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-11-14 16:57:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:21,591 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-11-14 16:57:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:57:21,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-14 16:57:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:57:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 16:57:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:57:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 16:57:21,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2018-11-14 16:57:22,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:22,011 INFO L225 Difference]: With dead ends: 94 [2018-11-14 16:57:22,011 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 16:57:22,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:57:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 16:57:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 16:57:22,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:22,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 16:57:22,143 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 16:57:22,143 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 16:57:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:22,145 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-14 16:57:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2018-11-14 16:57:22,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:22,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:22,146 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 16:57:22,146 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 16:57:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:22,148 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-14 16:57:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2018-11-14 16:57:22,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:22,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:22,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:22,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:57:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-14 16:57:22,150 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 59 [2018-11-14 16:57:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-14 16:57:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:57:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-14 16:57:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 16:57:22,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:22,152 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:22,152 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:22,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 522309478, now seen corresponding path program 12 times [2018-11-14 16:57:22,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:22,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:23,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2018-11-14 16:57:23,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4836#true} is VALID [2018-11-14 16:57:23,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2018-11-14 16:57:23,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #73#return; {4836#true} is VALID [2018-11-14 16:57:23,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2018-11-14 16:57:23,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {4836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4838#(= main_~i~0 0)} is VALID [2018-11-14 16:57:23,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {4838#(= main_~i~0 0)} assume true; {4838#(= main_~i~0 0)} is VALID [2018-11-14 16:57:23,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {4838#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4838#(= main_~i~0 0)} is VALID [2018-11-14 16:57:23,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {4838#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4838#(= main_~i~0 0)} is VALID [2018-11-14 16:57:23,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {4838#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#(<= main_~i~0 1)} assume true; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {4840#(<= main_~i~0 2)} assume true; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {4840#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {4840#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {4841#(<= main_~i~0 3)} assume true; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {4841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {4841#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {4841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {4842#(<= main_~i~0 4)} assume true; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,336 INFO L273 TraceCheckUtils]: 24: Hoare triple {4842#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {4842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {4843#(<= main_~i~0 5)} assume true; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {4843#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {4843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {4844#(<= main_~i~0 6)} assume true; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {4844#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {4844#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {4844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(<= main_~i~0 7)} assume true; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {4845#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,343 INFO L273 TraceCheckUtils]: 36: Hoare triple {4845#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,344 INFO L273 TraceCheckUtils]: 38: Hoare triple {4846#(<= main_~i~0 8)} assume true; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {4846#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {4846#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {4846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#(<= main_~i~0 9)} assume true; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {4848#(<= main_~i~0 10)} assume true; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {4848#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {4848#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {4848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {4849#(<= main_~i~0 11)} assume true; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {4849#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,352 INFO L273 TraceCheckUtils]: 52: Hoare triple {4849#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,352 INFO L273 TraceCheckUtils]: 53: Hoare triple {4849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4850#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:23,353 INFO L273 TraceCheckUtils]: 54: Hoare triple {4850#(<= main_~i~0 12)} assume true; {4850#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:23,354 INFO L273 TraceCheckUtils]: 55: Hoare triple {4850#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4837#false} is VALID [2018-11-14 16:57:23,354 INFO L273 TraceCheckUtils]: 56: Hoare triple {4837#false} havoc ~x~0;~x~0 := 0; {4837#false} is VALID [2018-11-14 16:57:23,354 INFO L273 TraceCheckUtils]: 57: Hoare triple {4837#false} assume true; {4837#false} is VALID [2018-11-14 16:57:23,354 INFO L273 TraceCheckUtils]: 58: Hoare triple {4837#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {4837#false} is VALID [2018-11-14 16:57:23,354 INFO L256 TraceCheckUtils]: 59: Hoare triple {4837#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4837#false} is VALID [2018-11-14 16:57:23,355 INFO L273 TraceCheckUtils]: 60: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2018-11-14 16:57:23,355 INFO L273 TraceCheckUtils]: 61: Hoare triple {4837#false} assume ~cond == 0; {4837#false} is VALID [2018-11-14 16:57:23,355 INFO L273 TraceCheckUtils]: 62: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2018-11-14 16:57:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:23,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:23,359 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:57:23,368 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:57:23,516 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 16:57:23,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:23,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:23,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2018-11-14 16:57:23,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4836#true} is VALID [2018-11-14 16:57:23,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2018-11-14 16:57:23,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #73#return; {4836#true} is VALID [2018-11-14 16:57:23,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2018-11-14 16:57:23,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {4836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:23,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {4869#(<= main_~i~0 0)} assume true; {4869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:23,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {4869#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:23,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {4869#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:23,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {4869#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#(<= main_~i~0 1)} assume true; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4839#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:23,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {4840#(<= main_~i~0 2)} assume true; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {4840#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {4840#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4840#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:23,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {4841#(<= main_~i~0 3)} assume true; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {4841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {4841#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4841#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:23,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {4841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {4842#(<= main_~i~0 4)} assume true; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {4842#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4842#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:23,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {4842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {4843#(<= main_~i~0 5)} assume true; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {4843#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4843#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:23,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {4843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {4844#(<= main_~i~0 6)} assume true; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {4844#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {4844#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4844#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:23,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {4844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(<= main_~i~0 7)} assume true; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {4845#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {4845#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4845#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:23,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {4846#(<= main_~i~0 8)} assume true; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {4846#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {4846#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4846#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:23,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {4846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#(<= main_~i~0 9)} assume true; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4847#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:23,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,674 INFO L273 TraceCheckUtils]: 46: Hoare triple {4848#(<= main_~i~0 10)} assume true; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {4848#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {4848#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4848#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:23,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {4848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {4849#(<= main_~i~0 11)} assume true; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {4849#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {4849#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4849#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:23,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {4849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4850#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:23,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {4850#(<= main_~i~0 12)} assume true; {4850#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:23,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {4850#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4837#false} is VALID [2018-11-14 16:57:23,679 INFO L273 TraceCheckUtils]: 56: Hoare triple {4837#false} havoc ~x~0;~x~0 := 0; {4837#false} is VALID [2018-11-14 16:57:23,679 INFO L273 TraceCheckUtils]: 57: Hoare triple {4837#false} assume true; {4837#false} is VALID [2018-11-14 16:57:23,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {4837#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {4837#false} is VALID [2018-11-14 16:57:23,680 INFO L256 TraceCheckUtils]: 59: Hoare triple {4837#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4837#false} is VALID [2018-11-14 16:57:23,680 INFO L273 TraceCheckUtils]: 60: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2018-11-14 16:57:23,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {4837#false} assume ~cond == 0; {4837#false} is VALID [2018-11-14 16:57:23,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2018-11-14 16:57:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:23,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:23,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 16:57:23,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-14 16:57:23,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:23,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:57:23,766 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:57:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:57:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:57:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:57:23,767 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 16 states. [2018-11-14 16:57:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:24,348 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-14 16:57:24,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:57:24,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-14 16:57:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:57:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2018-11-14 16:57:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:57:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2018-11-14 16:57:24,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2018-11-14 16:57:25,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:25,328 INFO L225 Difference]: With dead ends: 98 [2018-11-14 16:57:25,329 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:57:25,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:57:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:57:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-14 16:57:25,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:25,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-14 16:57:25,344 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-14 16:57:25,344 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-14 16:57:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:25,347 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2018-11-14 16:57:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-11-14 16:57:25,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:25,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:25,347 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-14 16:57:25,348 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-14 16:57:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:25,355 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2018-11-14 16:57:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-11-14 16:57:25,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:25,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:25,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:25,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:57:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-14 16:57:25,359 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 63 [2018-11-14 16:57:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:25,360 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-14 16:57:25,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:57:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-14 16:57:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 16:57:25,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:25,361 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:25,361 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:25,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1233232003, now seen corresponding path program 13 times [2018-11-14 16:57:25,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:25,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:25,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:25,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {5427#true} call ULTIMATE.init(); {5427#true} is VALID [2018-11-14 16:57:25,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {5427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5427#true} is VALID [2018-11-14 16:57:25,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {5427#true} assume true; {5427#true} is VALID [2018-11-14 16:57:25,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5427#true} {5427#true} #73#return; {5427#true} is VALID [2018-11-14 16:57:25,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {5427#true} call #t~ret7 := main(); {5427#true} is VALID [2018-11-14 16:57:25,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {5427#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5429#(= main_~i~0 0)} is VALID [2018-11-14 16:57:25,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {5429#(= main_~i~0 0)} assume true; {5429#(= main_~i~0 0)} is VALID [2018-11-14 16:57:25,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {5429#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5429#(= main_~i~0 0)} is VALID [2018-11-14 16:57:25,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {5429#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5429#(= main_~i~0 0)} is VALID [2018-11-14 16:57:25,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {5429#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:25,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#(<= main_~i~0 1)} assume true; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:25,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:25,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:25,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:25,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {5431#(<= main_~i~0 2)} assume true; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:25,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {5431#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:25,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {5431#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:25,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {5431#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:25,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {5432#(<= main_~i~0 3)} assume true; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:25,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {5432#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:25,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {5432#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:25,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {5432#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:25,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {5433#(<= main_~i~0 4)} assume true; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:25,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {5433#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:25,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {5433#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:25,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {5433#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:25,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {5434#(<= main_~i~0 5)} assume true; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:25,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {5434#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:25,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {5434#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:25,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {5434#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:25,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {5435#(<= main_~i~0 6)} assume true; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:25,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:25,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {5435#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:25,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {5435#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:25,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#(<= main_~i~0 7)} assume true; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:25,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:25,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:25,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:25,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#(<= main_~i~0 8)} assume true; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:25,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:25,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:25,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:25,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {5438#(<= main_~i~0 9)} assume true; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:25,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {5438#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:25,963 INFO L273 TraceCheckUtils]: 44: Hoare triple {5438#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:25,964 INFO L273 TraceCheckUtils]: 45: Hoare triple {5438#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:25,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {5439#(<= main_~i~0 10)} assume true; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:25,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {5439#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:25,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {5439#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:25,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {5439#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:25,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {5440#(<= main_~i~0 11)} assume true; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:25,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {5440#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:25,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {5440#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:25,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {5440#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:25,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(<= main_~i~0 12)} assume true; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:25,970 INFO L273 TraceCheckUtils]: 55: Hoare triple {5441#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:25,970 INFO L273 TraceCheckUtils]: 56: Hoare triple {5441#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:25,971 INFO L273 TraceCheckUtils]: 57: Hoare triple {5441#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5442#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:25,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {5442#(<= main_~i~0 13)} assume true; {5442#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:25,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {5442#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5428#false} is VALID [2018-11-14 16:57:25,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {5428#false} havoc ~x~0;~x~0 := 0; {5428#false} is VALID [2018-11-14 16:57:25,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {5428#false} assume true; {5428#false} is VALID [2018-11-14 16:57:25,973 INFO L273 TraceCheckUtils]: 62: Hoare triple {5428#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {5428#false} is VALID [2018-11-14 16:57:25,973 INFO L256 TraceCheckUtils]: 63: Hoare triple {5428#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5428#false} is VALID [2018-11-14 16:57:25,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {5428#false} ~cond := #in~cond; {5428#false} is VALID [2018-11-14 16:57:25,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {5428#false} assume ~cond == 0; {5428#false} is VALID [2018-11-14 16:57:25,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {5428#false} assume !false; {5428#false} is VALID [2018-11-14 16:57:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:25,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:25,977 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:57:25,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:26,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:26,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {5427#true} call ULTIMATE.init(); {5427#true} is VALID [2018-11-14 16:57:26,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {5427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5427#true} is VALID [2018-11-14 16:57:26,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {5427#true} assume true; {5427#true} is VALID [2018-11-14 16:57:26,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5427#true} {5427#true} #73#return; {5427#true} is VALID [2018-11-14 16:57:26,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {5427#true} call #t~ret7 := main(); {5427#true} is VALID [2018-11-14 16:57:26,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {5427#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5461#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:26,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {5461#(<= main_~i~0 0)} assume true; {5461#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:26,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {5461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5461#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:26,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {5461#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5461#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:26,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {5461#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:26,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#(<= main_~i~0 1)} assume true; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:26,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:26,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5430#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:26,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:26,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {5431#(<= main_~i~0 2)} assume true; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:26,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {5431#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:26,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {5431#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5431#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:26,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {5431#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:26,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {5432#(<= main_~i~0 3)} assume true; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:26,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {5432#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:26,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {5432#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5432#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:26,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {5432#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:26,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {5433#(<= main_~i~0 4)} assume true; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:26,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {5433#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:26,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {5433#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5433#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:26,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {5433#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:26,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {5434#(<= main_~i~0 5)} assume true; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:26,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {5434#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:26,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {5434#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5434#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:26,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {5434#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:26,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {5435#(<= main_~i~0 6)} assume true; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:26,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:26,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {5435#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5435#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:26,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {5435#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:26,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#(<= main_~i~0 7)} assume true; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:26,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:26,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5436#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:26,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:26,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#(<= main_~i~0 8)} assume true; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:26,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:26,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5437#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:26,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:26,180 INFO L273 TraceCheckUtils]: 42: Hoare triple {5438#(<= main_~i~0 9)} assume true; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:26,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {5438#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:26,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {5438#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5438#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:26,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {5438#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:26,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {5439#(<= main_~i~0 10)} assume true; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:26,183 INFO L273 TraceCheckUtils]: 47: Hoare triple {5439#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:26,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {5439#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5439#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:26,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {5439#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:26,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {5440#(<= main_~i~0 11)} assume true; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:26,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {5440#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:26,186 INFO L273 TraceCheckUtils]: 52: Hoare triple {5440#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5440#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:26,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {5440#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:26,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(<= main_~i~0 12)} assume true; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:26,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {5441#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:26,188 INFO L273 TraceCheckUtils]: 56: Hoare triple {5441#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5441#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:26,189 INFO L273 TraceCheckUtils]: 57: Hoare triple {5441#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5442#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:26,189 INFO L273 TraceCheckUtils]: 58: Hoare triple {5442#(<= main_~i~0 13)} assume true; {5442#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:26,190 INFO L273 TraceCheckUtils]: 59: Hoare triple {5442#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5428#false} is VALID [2018-11-14 16:57:26,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {5428#false} havoc ~x~0;~x~0 := 0; {5428#false} is VALID [2018-11-14 16:57:26,190 INFO L273 TraceCheckUtils]: 61: Hoare triple {5428#false} assume true; {5428#false} is VALID [2018-11-14 16:57:26,191 INFO L273 TraceCheckUtils]: 62: Hoare triple {5428#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {5428#false} is VALID [2018-11-14 16:57:26,191 INFO L256 TraceCheckUtils]: 63: Hoare triple {5428#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5428#false} is VALID [2018-11-14 16:57:26,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {5428#false} ~cond := #in~cond; {5428#false} is VALID [2018-11-14 16:57:26,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {5428#false} assume ~cond == 0; {5428#false} is VALID [2018-11-14 16:57:26,191 INFO L273 TraceCheckUtils]: 66: Hoare triple {5428#false} assume !false; {5428#false} is VALID [2018-11-14 16:57:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:57:26,216 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 16:57:26,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:26,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:57:26,283 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:57:26,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:57:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:57:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:57:26,284 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 17 states. [2018-11-14 16:57:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:26,529 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-11-14 16:57:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:57:26,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 16:57:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:57:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2018-11-14 16:57:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:57:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2018-11-14 16:57:26,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 123 transitions. [2018-11-14 16:57:26,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:26,702 INFO L225 Difference]: With dead ends: 102 [2018-11-14 16:57:26,703 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:57:26,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:57:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:57:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-14 16:57:26,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:26,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-14 16:57:26,726 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-14 16:57:26,726 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-14 16:57:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:26,728 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-14 16:57:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-14 16:57:26,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:26,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:26,729 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-14 16:57:26,729 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-14 16:57:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:26,731 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-14 16:57:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-14 16:57:26,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:26,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:26,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:26,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:57:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-14 16:57:26,734 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 67 [2018-11-14 16:57:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:26,735 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-14 16:57:26,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:57:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-14 16:57:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 16:57:26,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:26,736 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:26,736 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:26,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 777456660, now seen corresponding path program 14 times [2018-11-14 16:57:26,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:26,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:26,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:26,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:28,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {6049#true} call ULTIMATE.init(); {6049#true} is VALID [2018-11-14 16:57:28,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {6049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6049#true} is VALID [2018-11-14 16:57:28,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {6049#true} assume true; {6049#true} is VALID [2018-11-14 16:57:28,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6049#true} {6049#true} #73#return; {6049#true} is VALID [2018-11-14 16:57:28,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {6049#true} call #t~ret7 := main(); {6049#true} is VALID [2018-11-14 16:57:28,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {6049#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6051#(= main_~i~0 0)} is VALID [2018-11-14 16:57:28,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {6051#(= main_~i~0 0)} assume true; {6051#(= main_~i~0 0)} is VALID [2018-11-14 16:57:28,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {6051#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6051#(= main_~i~0 0)} is VALID [2018-11-14 16:57:28,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {6051#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6051#(= main_~i~0 0)} is VALID [2018-11-14 16:57:28,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {6051#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {6052#(<= main_~i~0 1)} assume true; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {6052#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {6052#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {6052#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#(<= main_~i~0 2)} assume true; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {6054#(<= main_~i~0 3)} assume true; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {6054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {6054#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {6054#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {6055#(<= main_~i~0 4)} assume true; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {6055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {6055#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {6055#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {6056#(<= main_~i~0 5)} assume true; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {6056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {6056#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {6056#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {6057#(<= main_~i~0 6)} assume true; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {6057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {6057#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {6058#(<= main_~i~0 7)} assume true; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {6058#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= main_~i~0 8)} assume true; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {6059#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {6060#(<= main_~i~0 9)} assume true; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {6060#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,030 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 10)} assume true; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,031 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,031 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,032 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,032 INFO L273 TraceCheckUtils]: 50: Hoare triple {6062#(<= main_~i~0 11)} assume true; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {6062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {6062#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {6062#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {6063#(<= main_~i~0 12)} assume true; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,035 INFO L273 TraceCheckUtils]: 55: Hoare triple {6063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {6063#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {6063#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,037 INFO L273 TraceCheckUtils]: 58: Hoare triple {6064#(<= main_~i~0 13)} assume true; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,037 INFO L273 TraceCheckUtils]: 59: Hoare triple {6064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,038 INFO L273 TraceCheckUtils]: 60: Hoare triple {6064#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,039 INFO L273 TraceCheckUtils]: 61: Hoare triple {6064#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6065#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:28,039 INFO L273 TraceCheckUtils]: 62: Hoare triple {6065#(<= main_~i~0 14)} assume true; {6065#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:28,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {6065#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6050#false} is VALID [2018-11-14 16:57:28,040 INFO L273 TraceCheckUtils]: 64: Hoare triple {6050#false} havoc ~x~0;~x~0 := 0; {6050#false} is VALID [2018-11-14 16:57:28,040 INFO L273 TraceCheckUtils]: 65: Hoare triple {6050#false} assume true; {6050#false} is VALID [2018-11-14 16:57:28,040 INFO L273 TraceCheckUtils]: 66: Hoare triple {6050#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {6050#false} is VALID [2018-11-14 16:57:28,041 INFO L256 TraceCheckUtils]: 67: Hoare triple {6050#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6050#false} is VALID [2018-11-14 16:57:28,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {6050#false} ~cond := #in~cond; {6050#false} is VALID [2018-11-14 16:57:28,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {6050#false} assume ~cond == 0; {6050#false} is VALID [2018-11-14 16:57:28,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {6050#false} assume !false; {6050#false} is VALID [2018-11-14 16:57:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:28,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:28,045 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:57:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:57:28,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:57:28,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:28,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:28,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {6049#true} call ULTIMATE.init(); {6049#true} is VALID [2018-11-14 16:57:28,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {6049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6049#true} is VALID [2018-11-14 16:57:28,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {6049#true} assume true; {6049#true} is VALID [2018-11-14 16:57:28,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6049#true} {6049#true} #73#return; {6049#true} is VALID [2018-11-14 16:57:28,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {6049#true} call #t~ret7 := main(); {6049#true} is VALID [2018-11-14 16:57:28,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {6049#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6084#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:28,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {6084#(<= main_~i~0 0)} assume true; {6084#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:28,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {6084#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6084#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:28,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6084#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:28,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {6052#(<= main_~i~0 1)} assume true; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {6052#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {6052#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6052#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:28,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {6052#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#(<= main_~i~0 2)} assume true; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6053#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:28,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {6054#(<= main_~i~0 3)} assume true; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {6054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6054#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6054#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:28,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {6054#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6055#(<= main_~i~0 4)} assume true; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {6055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {6055#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6055#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:28,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {6055#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {6056#(<= main_~i~0 5)} assume true; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {6056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {6056#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6056#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:28,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {6056#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {6057#(<= main_~i~0 6)} assume true; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {6057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {6057#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6057#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:28,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {6058#(<= main_~i~0 7)} assume true; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6058#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:28,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {6058#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= main_~i~0 8)} assume true; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {6059#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6059#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:28,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {6060#(<= main_~i~0 9)} assume true; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,267 INFO L273 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,267 INFO L273 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6060#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:28,268 INFO L273 TraceCheckUtils]: 45: Hoare triple {6060#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 10)} assume true; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,269 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,270 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6061#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:28,270 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {6062#(<= main_~i~0 11)} assume true; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {6062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,272 INFO L273 TraceCheckUtils]: 52: Hoare triple {6062#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6062#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:28,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {6062#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {6063#(<= main_~i~0 12)} assume true; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {6063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {6063#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6063#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:28,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {6063#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,276 INFO L273 TraceCheckUtils]: 58: Hoare triple {6064#(<= main_~i~0 13)} assume true; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {6064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {6064#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6064#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:28,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {6064#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6065#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:28,278 INFO L273 TraceCheckUtils]: 62: Hoare triple {6065#(<= main_~i~0 14)} assume true; {6065#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:28,279 INFO L273 TraceCheckUtils]: 63: Hoare triple {6065#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6050#false} is VALID [2018-11-14 16:57:28,279 INFO L273 TraceCheckUtils]: 64: Hoare triple {6050#false} havoc ~x~0;~x~0 := 0; {6050#false} is VALID [2018-11-14 16:57:28,279 INFO L273 TraceCheckUtils]: 65: Hoare triple {6050#false} assume true; {6050#false} is VALID [2018-11-14 16:57:28,279 INFO L273 TraceCheckUtils]: 66: Hoare triple {6050#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {6050#false} is VALID [2018-11-14 16:57:28,279 INFO L256 TraceCheckUtils]: 67: Hoare triple {6050#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6050#false} is VALID [2018-11-14 16:57:28,280 INFO L273 TraceCheckUtils]: 68: Hoare triple {6050#false} ~cond := #in~cond; {6050#false} is VALID [2018-11-14 16:57:28,280 INFO L273 TraceCheckUtils]: 69: Hoare triple {6050#false} assume ~cond == 0; {6050#false} is VALID [2018-11-14 16:57:28,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {6050#false} assume !false; {6050#false} is VALID [2018-11-14 16:57:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:28,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:28,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:57:28,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-14 16:57:28,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:28,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:57:28,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:28,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:57:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:57:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:57:28,375 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 18 states. [2018-11-14 16:57:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:28,843 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-11-14 16:57:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:57:28,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-14 16:57:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:57:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2018-11-14 16:57:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:57:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2018-11-14 16:57:28,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 128 transitions. [2018-11-14 16:57:28,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:28,977 INFO L225 Difference]: With dead ends: 106 [2018-11-14 16:57:28,977 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 16:57:28,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:57:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 16:57:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-14 16:57:28,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:28,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-14 16:57:28,997 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-14 16:57:28,997 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-14 16:57:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:28,999 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2018-11-14 16:57:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-11-14 16:57:29,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:29,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:29,000 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-14 16:57:29,000 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-14 16:57:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:29,002 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2018-11-14 16:57:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-11-14 16:57:29,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:29,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:29,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:29,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 16:57:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2018-11-14 16:57:29,006 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 71 [2018-11-14 16:57:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:29,006 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2018-11-14 16:57:29,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:57:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-14 16:57:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 16:57:29,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:29,007 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:29,008 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:29,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2051642667, now seen corresponding path program 15 times [2018-11-14 16:57:29,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:29,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:29,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:29,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:29,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:29,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {6702#true} call ULTIMATE.init(); {6702#true} is VALID [2018-11-14 16:57:29,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {6702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6702#true} is VALID [2018-11-14 16:57:29,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {6702#true} assume true; {6702#true} is VALID [2018-11-14 16:57:29,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6702#true} {6702#true} #73#return; {6702#true} is VALID [2018-11-14 16:57:29,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {6702#true} call #t~ret7 := main(); {6702#true} is VALID [2018-11-14 16:57:29,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {6702#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6704#(= main_~i~0 0)} is VALID [2018-11-14 16:57:29,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {6704#(= main_~i~0 0)} assume true; {6704#(= main_~i~0 0)} is VALID [2018-11-14 16:57:29,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {6704#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6704#(= main_~i~0 0)} is VALID [2018-11-14 16:57:29,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {6704#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6704#(= main_~i~0 0)} is VALID [2018-11-14 16:57:29,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {6704#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:29,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {6705#(<= main_~i~0 1)} assume true; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:29,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {6705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:29,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {6705#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:29,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {6705#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:29,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {6706#(<= main_~i~0 2)} assume true; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:29,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {6706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:29,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {6706#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:29,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {6706#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:29,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {6707#(<= main_~i~0 3)} assume true; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:29,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {6707#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:29,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {6707#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:29,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {6707#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:29,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {6708#(<= main_~i~0 4)} assume true; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:29,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {6708#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:29,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {6708#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:29,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {6708#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:29,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {6709#(<= main_~i~0 5)} assume true; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:29,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {6709#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:29,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {6709#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:29,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {6709#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:29,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {6710#(<= main_~i~0 6)} assume true; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:29,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {6710#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:29,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {6710#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:29,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {6710#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:29,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {6711#(<= main_~i~0 7)} assume true; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:29,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {6711#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:29,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {6711#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:29,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {6711#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:29,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {6712#(<= main_~i~0 8)} assume true; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:29,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {6712#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:29,823 INFO L273 TraceCheckUtils]: 40: Hoare triple {6712#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:29,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {6712#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:29,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {6713#(<= main_~i~0 9)} assume true; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:29,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {6713#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:29,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {6713#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:29,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {6713#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:29,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {6714#(<= main_~i~0 10)} assume true; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:29,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {6714#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:29,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {6714#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:29,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {6714#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:29,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {6715#(<= main_~i~0 11)} assume true; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:29,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {6715#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:29,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {6715#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:29,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {6715#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:29,852 INFO L273 TraceCheckUtils]: 54: Hoare triple {6716#(<= main_~i~0 12)} assume true; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:29,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {6716#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:29,853 INFO L273 TraceCheckUtils]: 56: Hoare triple {6716#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:29,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {6716#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:29,854 INFO L273 TraceCheckUtils]: 58: Hoare triple {6717#(<= main_~i~0 13)} assume true; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:29,854 INFO L273 TraceCheckUtils]: 59: Hoare triple {6717#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:29,854 INFO L273 TraceCheckUtils]: 60: Hoare triple {6717#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:29,855 INFO L273 TraceCheckUtils]: 61: Hoare triple {6717#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:29,855 INFO L273 TraceCheckUtils]: 62: Hoare triple {6718#(<= main_~i~0 14)} assume true; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:29,856 INFO L273 TraceCheckUtils]: 63: Hoare triple {6718#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:29,857 INFO L273 TraceCheckUtils]: 64: Hoare triple {6718#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:29,858 INFO L273 TraceCheckUtils]: 65: Hoare triple {6718#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6719#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:29,858 INFO L273 TraceCheckUtils]: 66: Hoare triple {6719#(<= main_~i~0 15)} assume true; {6719#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:29,859 INFO L273 TraceCheckUtils]: 67: Hoare triple {6719#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6703#false} is VALID [2018-11-14 16:57:29,859 INFO L273 TraceCheckUtils]: 68: Hoare triple {6703#false} havoc ~x~0;~x~0 := 0; {6703#false} is VALID [2018-11-14 16:57:29,860 INFO L273 TraceCheckUtils]: 69: Hoare triple {6703#false} assume true; {6703#false} is VALID [2018-11-14 16:57:29,860 INFO L273 TraceCheckUtils]: 70: Hoare triple {6703#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {6703#false} is VALID [2018-11-14 16:57:29,860 INFO L256 TraceCheckUtils]: 71: Hoare triple {6703#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6703#false} is VALID [2018-11-14 16:57:29,860 INFO L273 TraceCheckUtils]: 72: Hoare triple {6703#false} ~cond := #in~cond; {6703#false} is VALID [2018-11-14 16:57:29,861 INFO L273 TraceCheckUtils]: 73: Hoare triple {6703#false} assume ~cond == 0; {6703#false} is VALID [2018-11-14 16:57:29,861 INFO L273 TraceCheckUtils]: 74: Hoare triple {6703#false} assume !false; {6703#false} is VALID [2018-11-14 16:57:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:29,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:29,869 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:57:29,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:57:30,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 16:57:30,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:30,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:30,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {6702#true} call ULTIMATE.init(); {6702#true} is VALID [2018-11-14 16:57:30,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {6702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6702#true} is VALID [2018-11-14 16:57:30,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {6702#true} assume true; {6702#true} is VALID [2018-11-14 16:57:30,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6702#true} {6702#true} #73#return; {6702#true} is VALID [2018-11-14 16:57:30,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {6702#true} call #t~ret7 := main(); {6702#true} is VALID [2018-11-14 16:57:30,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {6702#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6738#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:30,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {6738#(<= main_~i~0 0)} assume true; {6738#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:30,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {6738#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6738#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:30,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {6738#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6738#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:30,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {6738#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:30,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {6705#(<= main_~i~0 1)} assume true; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:30,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {6705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:30,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {6705#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6705#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:30,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {6705#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:30,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {6706#(<= main_~i~0 2)} assume true; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:30,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {6706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:30,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {6706#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6706#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:30,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {6706#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:30,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {6707#(<= main_~i~0 3)} assume true; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:30,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {6707#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:30,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {6707#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6707#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:30,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {6707#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:30,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {6708#(<= main_~i~0 4)} assume true; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:30,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {6708#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:30,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {6708#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6708#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:30,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {6708#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:30,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {6709#(<= main_~i~0 5)} assume true; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:30,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {6709#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:30,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {6709#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6709#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:30,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {6709#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:30,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {6710#(<= main_~i~0 6)} assume true; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:30,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {6710#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:30,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {6710#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6710#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:30,373 INFO L273 TraceCheckUtils]: 33: Hoare triple {6710#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:30,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {6711#(<= main_~i~0 7)} assume true; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:30,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {6711#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:30,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {6711#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6711#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:30,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {6711#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:30,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {6712#(<= main_~i~0 8)} assume true; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:30,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {6712#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:30,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {6712#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6712#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:30,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {6712#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:30,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {6713#(<= main_~i~0 9)} assume true; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:30,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {6713#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:30,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {6713#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6713#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:30,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {6713#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:30,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {6714#(<= main_~i~0 10)} assume true; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:30,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {6714#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:30,383 INFO L273 TraceCheckUtils]: 48: Hoare triple {6714#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6714#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:30,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {6714#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:30,384 INFO L273 TraceCheckUtils]: 50: Hoare triple {6715#(<= main_~i~0 11)} assume true; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:30,385 INFO L273 TraceCheckUtils]: 51: Hoare triple {6715#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:30,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {6715#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6715#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:30,386 INFO L273 TraceCheckUtils]: 53: Hoare triple {6715#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:30,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {6716#(<= main_~i~0 12)} assume true; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:30,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {6716#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:30,388 INFO L273 TraceCheckUtils]: 56: Hoare triple {6716#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6716#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:30,389 INFO L273 TraceCheckUtils]: 57: Hoare triple {6716#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:30,390 INFO L273 TraceCheckUtils]: 58: Hoare triple {6717#(<= main_~i~0 13)} assume true; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:30,390 INFO L273 TraceCheckUtils]: 59: Hoare triple {6717#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:30,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {6717#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6717#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:30,392 INFO L273 TraceCheckUtils]: 61: Hoare triple {6717#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:30,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {6718#(<= main_~i~0 14)} assume true; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:30,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {6718#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:30,394 INFO L273 TraceCheckUtils]: 64: Hoare triple {6718#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {6718#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:30,394 INFO L273 TraceCheckUtils]: 65: Hoare triple {6718#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6719#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:30,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {6719#(<= main_~i~0 15)} assume true; {6719#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:30,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {6719#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6703#false} is VALID [2018-11-14 16:57:30,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {6703#false} havoc ~x~0;~x~0 := 0; {6703#false} is VALID [2018-11-14 16:57:30,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {6703#false} assume true; {6703#false} is VALID [2018-11-14 16:57:30,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {6703#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {6703#false} is VALID [2018-11-14 16:57:30,397 INFO L256 TraceCheckUtils]: 71: Hoare triple {6703#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6703#false} is VALID [2018-11-14 16:57:30,397 INFO L273 TraceCheckUtils]: 72: Hoare triple {6703#false} ~cond := #in~cond; {6703#false} is VALID [2018-11-14 16:57:30,397 INFO L273 TraceCheckUtils]: 73: Hoare triple {6703#false} assume ~cond == 0; {6703#false} is VALID [2018-11-14 16:57:30,397 INFO L273 TraceCheckUtils]: 74: Hoare triple {6703#false} assume !false; {6703#false} is VALID [2018-11-14 16:57:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:30,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:30,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 16:57:30,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-14 16:57:30,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:30,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:57:30,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:30,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:57:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:57:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:57:30,529 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 19 states. [2018-11-14 16:57:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:31,732 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2018-11-14 16:57:31,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:57:31,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-14 16:57:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:57:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-14 16:57:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:57:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-14 16:57:31,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 133 transitions. [2018-11-14 16:57:31,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:31,866 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:57:31,866 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:57:31,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:57:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:57:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-14 16:57:32,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:32,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-14 16:57:32,011 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-14 16:57:32,011 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-14 16:57:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:32,014 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-14 16:57:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2018-11-14 16:57:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:32,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:32,015 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-14 16:57:32,015 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-14 16:57:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:32,017 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-14 16:57:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2018-11-14 16:57:32,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:32,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:32,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:32,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 16:57:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-14 16:57:32,020 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 75 [2018-11-14 16:57:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:32,020 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-14 16:57:32,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:57:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-14 16:57:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 16:57:32,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:32,021 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:32,022 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:32,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:32,022 INFO L82 PathProgramCache]: Analyzing trace with hash 152287938, now seen corresponding path program 16 times [2018-11-14 16:57:32,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:32,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:32,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:32,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {7386#true} call ULTIMATE.init(); {7386#true} is VALID [2018-11-14 16:57:32,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {7386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7386#true} is VALID [2018-11-14 16:57:32,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {7386#true} assume true; {7386#true} is VALID [2018-11-14 16:57:32,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7386#true} {7386#true} #73#return; {7386#true} is VALID [2018-11-14 16:57:32,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {7386#true} call #t~ret7 := main(); {7386#true} is VALID [2018-11-14 16:57:32,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {7386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7388#(= main_~i~0 0)} is VALID [2018-11-14 16:57:32,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {7388#(= main_~i~0 0)} assume true; {7388#(= main_~i~0 0)} is VALID [2018-11-14 16:57:32,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {7388#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7388#(= main_~i~0 0)} is VALID [2018-11-14 16:57:32,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {7388#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7388#(= main_~i~0 0)} is VALID [2018-11-14 16:57:32,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {7388#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {7389#(<= main_~i~0 1)} assume true; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {7389#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {7389#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {7389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {7390#(<= main_~i~0 2)} assume true; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {7390#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {7390#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {7390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {7391#(<= main_~i~0 3)} assume true; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {7391#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {7391#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {7391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {7392#(<= main_~i~0 4)} assume true; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {7392#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 5)} assume true; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {7393#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {7393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {7394#(<= main_~i~0 6)} assume true; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {7394#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {7394#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {7394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {7395#(<= main_~i~0 7)} assume true; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {7395#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {7395#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {7395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {7396#(<= main_~i~0 8)} assume true; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {7396#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {7396#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {7396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {7397#(<= main_~i~0 9)} assume true; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {7397#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {7397#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {7397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {7398#(<= main_~i~0 10)} assume true; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {7398#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {7398#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {7398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {7399#(<= main_~i~0 11)} assume true; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {7399#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {7399#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {7399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {7400#(<= main_~i~0 12)} assume true; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {7400#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {7400#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {7400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {7401#(<= main_~i~0 13)} assume true; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {7401#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,303 INFO L273 TraceCheckUtils]: 60: Hoare triple {7401#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {7401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,304 INFO L273 TraceCheckUtils]: 62: Hoare triple {7402#(<= main_~i~0 14)} assume true; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {7402#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {7402#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {7402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,307 INFO L273 TraceCheckUtils]: 66: Hoare triple {7403#(<= main_~i~0 15)} assume true; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,307 INFO L273 TraceCheckUtils]: 67: Hoare triple {7403#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,308 INFO L273 TraceCheckUtils]: 68: Hoare triple {7403#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,309 INFO L273 TraceCheckUtils]: 69: Hoare triple {7403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7404#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:32,309 INFO L273 TraceCheckUtils]: 70: Hoare triple {7404#(<= main_~i~0 16)} assume true; {7404#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:32,310 INFO L273 TraceCheckUtils]: 71: Hoare triple {7404#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7387#false} is VALID [2018-11-14 16:57:32,310 INFO L273 TraceCheckUtils]: 72: Hoare triple {7387#false} havoc ~x~0;~x~0 := 0; {7387#false} is VALID [2018-11-14 16:57:32,310 INFO L273 TraceCheckUtils]: 73: Hoare triple {7387#false} assume true; {7387#false} is VALID [2018-11-14 16:57:32,310 INFO L273 TraceCheckUtils]: 74: Hoare triple {7387#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {7387#false} is VALID [2018-11-14 16:57:32,311 INFO L256 TraceCheckUtils]: 75: Hoare triple {7387#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7387#false} is VALID [2018-11-14 16:57:32,311 INFO L273 TraceCheckUtils]: 76: Hoare triple {7387#false} ~cond := #in~cond; {7387#false} is VALID [2018-11-14 16:57:32,311 INFO L273 TraceCheckUtils]: 77: Hoare triple {7387#false} assume ~cond == 0; {7387#false} is VALID [2018-11-14 16:57:32,311 INFO L273 TraceCheckUtils]: 78: Hoare triple {7387#false} assume !false; {7387#false} is VALID [2018-11-14 16:57:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:32,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:32,316 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:57:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:57:32,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:57:32,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:32,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:32,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {7386#true} call ULTIMATE.init(); {7386#true} is VALID [2018-11-14 16:57:32,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {7386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7386#true} is VALID [2018-11-14 16:57:32,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {7386#true} assume true; {7386#true} is VALID [2018-11-14 16:57:32,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7386#true} {7386#true} #73#return; {7386#true} is VALID [2018-11-14 16:57:32,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {7386#true} call #t~ret7 := main(); {7386#true} is VALID [2018-11-14 16:57:32,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {7386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7423#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:32,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {7423#(<= main_~i~0 0)} assume true; {7423#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:32,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {7423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7423#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:32,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {7423#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7423#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:32,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {7423#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {7389#(<= main_~i~0 1)} assume true; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {7389#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {7389#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7389#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:32,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {7389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {7390#(<= main_~i~0 2)} assume true; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {7390#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {7390#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7390#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:32,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {7390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {7391#(<= main_~i~0 3)} assume true; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {7391#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {7391#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7391#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:32,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {7391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {7392#(<= main_~i~0 4)} assume true; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {7392#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7392#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:32,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 5)} assume true; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {7393#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7393#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:32,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {7393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {7394#(<= main_~i~0 6)} assume true; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {7394#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {7394#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7394#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:32,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {7394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {7395#(<= main_~i~0 7)} assume true; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {7395#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {7395#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7395#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:32,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {7395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {7396#(<= main_~i~0 8)} assume true; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {7396#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {7396#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7396#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:32,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {7396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {7397#(<= main_~i~0 9)} assume true; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {7397#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {7397#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7397#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:32,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {7397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {7398#(<= main_~i~0 10)} assume true; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {7398#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {7398#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7398#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:32,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {7398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {7399#(<= main_~i~0 11)} assume true; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {7399#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {7399#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7399#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:32,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {7399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {7400#(<= main_~i~0 12)} assume true; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {7400#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,724 INFO L273 TraceCheckUtils]: 56: Hoare triple {7400#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7400#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:32,725 INFO L273 TraceCheckUtils]: 57: Hoare triple {7400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,725 INFO L273 TraceCheckUtils]: 58: Hoare triple {7401#(<= main_~i~0 13)} assume true; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,726 INFO L273 TraceCheckUtils]: 59: Hoare triple {7401#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,726 INFO L273 TraceCheckUtils]: 60: Hoare triple {7401#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7401#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:32,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {7401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,727 INFO L273 TraceCheckUtils]: 62: Hoare triple {7402#(<= main_~i~0 14)} assume true; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,728 INFO L273 TraceCheckUtils]: 63: Hoare triple {7402#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,728 INFO L273 TraceCheckUtils]: 64: Hoare triple {7402#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7402#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:32,729 INFO L273 TraceCheckUtils]: 65: Hoare triple {7402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,730 INFO L273 TraceCheckUtils]: 66: Hoare triple {7403#(<= main_~i~0 15)} assume true; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,730 INFO L273 TraceCheckUtils]: 67: Hoare triple {7403#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {7403#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {7403#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:32,731 INFO L273 TraceCheckUtils]: 69: Hoare triple {7403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7404#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:32,732 INFO L273 TraceCheckUtils]: 70: Hoare triple {7404#(<= main_~i~0 16)} assume true; {7404#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:32,732 INFO L273 TraceCheckUtils]: 71: Hoare triple {7404#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7387#false} is VALID [2018-11-14 16:57:32,733 INFO L273 TraceCheckUtils]: 72: Hoare triple {7387#false} havoc ~x~0;~x~0 := 0; {7387#false} is VALID [2018-11-14 16:57:32,733 INFO L273 TraceCheckUtils]: 73: Hoare triple {7387#false} assume true; {7387#false} is VALID [2018-11-14 16:57:32,733 INFO L273 TraceCheckUtils]: 74: Hoare triple {7387#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {7387#false} is VALID [2018-11-14 16:57:32,733 INFO L256 TraceCheckUtils]: 75: Hoare triple {7387#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7387#false} is VALID [2018-11-14 16:57:32,733 INFO L273 TraceCheckUtils]: 76: Hoare triple {7387#false} ~cond := #in~cond; {7387#false} is VALID [2018-11-14 16:57:32,734 INFO L273 TraceCheckUtils]: 77: Hoare triple {7387#false} assume ~cond == 0; {7387#false} is VALID [2018-11-14 16:57:32,734 INFO L273 TraceCheckUtils]: 78: Hoare triple {7387#false} assume !false; {7387#false} is VALID [2018-11-14 16:57:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:32,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:32,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 16:57:32,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-14 16:57:32,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:32,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:57:32,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:32,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:57:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:57:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:57:32,839 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 20 states. [2018-11-14 16:57:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:33,335 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-11-14 16:57:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:57:33,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-14 16:57:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:57:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-14 16:57:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:57:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-14 16:57:33,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 138 transitions. [2018-11-14 16:57:33,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:33,466 INFO L225 Difference]: With dead ends: 114 [2018-11-14 16:57:33,466 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:57:33,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:57:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:57:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-14 16:57:33,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:33,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-14 16:57:33,485 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-14 16:57:33,485 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-14 16:57:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:33,487 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-14 16:57:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-14 16:57:33,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:33,488 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-14 16:57:33,488 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-14 16:57:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:33,490 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-14 16:57:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-14 16:57:33,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:33,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:33,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:33,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:57:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-14 16:57:33,493 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 79 [2018-11-14 16:57:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:33,493 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-14 16:57:33,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:57:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-14 16:57:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-14 16:57:33,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:33,494 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:33,495 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:33,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash 882064601, now seen corresponding path program 17 times [2018-11-14 16:57:33,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:33,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:33,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:34,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {8101#true} call ULTIMATE.init(); {8101#true} is VALID [2018-11-14 16:57:34,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {8101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8101#true} is VALID [2018-11-14 16:57:34,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {8101#true} assume true; {8101#true} is VALID [2018-11-14 16:57:34,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8101#true} {8101#true} #73#return; {8101#true} is VALID [2018-11-14 16:57:34,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {8101#true} call #t~ret7 := main(); {8101#true} is VALID [2018-11-14 16:57:34,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {8101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8103#(= main_~i~0 0)} is VALID [2018-11-14 16:57:34,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {8103#(= main_~i~0 0)} assume true; {8103#(= main_~i~0 0)} is VALID [2018-11-14 16:57:34,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {8103#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8103#(= main_~i~0 0)} is VALID [2018-11-14 16:57:34,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {8103#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8103#(= main_~i~0 0)} is VALID [2018-11-14 16:57:34,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {8103#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {8104#(<= main_~i~0 1)} assume true; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {8104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {8104#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {8104#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {8105#(<= main_~i~0 2)} assume true; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {8105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {8105#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {8105#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {8106#(<= main_~i~0 3)} assume true; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {8106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {8106#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {8106#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {8107#(<= main_~i~0 4)} assume true; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {8107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {8107#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {8107#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {8108#(<= main_~i~0 5)} assume true; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {8108#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {8108#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {8109#(<= main_~i~0 6)} assume true; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {8109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {8109#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,183 INFO L273 TraceCheckUtils]: 33: Hoare triple {8109#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {8110#(<= main_~i~0 7)} assume true; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {8110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {8110#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {8110#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {8111#(<= main_~i~0 8)} assume true; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {8111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {8111#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {8111#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {8112#(<= main_~i~0 9)} assume true; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {8112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {8112#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {8112#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {8113#(<= main_~i~0 10)} assume true; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {8113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,191 INFO L273 TraceCheckUtils]: 48: Hoare triple {8113#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {8113#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,193 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= main_~i~0 11)} assume true; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,193 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,194 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,194 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {8115#(<= main_~i~0 12)} assume true; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {8115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,196 INFO L273 TraceCheckUtils]: 56: Hoare triple {8115#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {8115#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {8116#(<= main_~i~0 13)} assume true; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {8116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {8116#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,199 INFO L273 TraceCheckUtils]: 61: Hoare triple {8116#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,199 INFO L273 TraceCheckUtils]: 62: Hoare triple {8117#(<= main_~i~0 14)} assume true; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {8117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {8117#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {8117#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {8118#(<= main_~i~0 15)} assume true; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {8118#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {8118#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,203 INFO L273 TraceCheckUtils]: 69: Hoare triple {8118#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {8119#(<= main_~i~0 16)} assume true; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,204 INFO L273 TraceCheckUtils]: 71: Hoare triple {8119#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,205 INFO L273 TraceCheckUtils]: 72: Hoare triple {8119#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,205 INFO L273 TraceCheckUtils]: 73: Hoare triple {8119#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8120#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:34,206 INFO L273 TraceCheckUtils]: 74: Hoare triple {8120#(<= main_~i~0 17)} assume true; {8120#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:34,206 INFO L273 TraceCheckUtils]: 75: Hoare triple {8120#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8102#false} is VALID [2018-11-14 16:57:34,207 INFO L273 TraceCheckUtils]: 76: Hoare triple {8102#false} havoc ~x~0;~x~0 := 0; {8102#false} is VALID [2018-11-14 16:57:34,207 INFO L273 TraceCheckUtils]: 77: Hoare triple {8102#false} assume true; {8102#false} is VALID [2018-11-14 16:57:34,207 INFO L273 TraceCheckUtils]: 78: Hoare triple {8102#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {8102#false} is VALID [2018-11-14 16:57:34,207 INFO L256 TraceCheckUtils]: 79: Hoare triple {8102#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8102#false} is VALID [2018-11-14 16:57:34,207 INFO L273 TraceCheckUtils]: 80: Hoare triple {8102#false} ~cond := #in~cond; {8102#false} is VALID [2018-11-14 16:57:34,208 INFO L273 TraceCheckUtils]: 81: Hoare triple {8102#false} assume ~cond == 0; {8102#false} is VALID [2018-11-14 16:57:34,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {8102#false} assume !false; {8102#false} is VALID [2018-11-14 16:57:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:34,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:34,213 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:57:34,224 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:57:34,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 16:57:34,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:34,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:34,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {8101#true} call ULTIMATE.init(); {8101#true} is VALID [2018-11-14 16:57:34,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {8101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8101#true} is VALID [2018-11-14 16:57:34,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {8101#true} assume true; {8101#true} is VALID [2018-11-14 16:57:34,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8101#true} {8101#true} #73#return; {8101#true} is VALID [2018-11-14 16:57:34,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {8101#true} call #t~ret7 := main(); {8101#true} is VALID [2018-11-14 16:57:34,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {8101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8139#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:34,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {8139#(<= main_~i~0 0)} assume true; {8139#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:34,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {8139#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8139#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:34,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {8139#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8139#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:34,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {8139#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {8104#(<= main_~i~0 1)} assume true; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {8104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {8104#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8104#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:34,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {8104#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {8105#(<= main_~i~0 2)} assume true; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {8105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {8105#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8105#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:34,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {8105#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {8106#(<= main_~i~0 3)} assume true; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {8106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {8106#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8106#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:34,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {8106#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {8107#(<= main_~i~0 4)} assume true; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {8107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {8107#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8107#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:34,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {8107#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {8108#(<= main_~i~0 5)} assume true; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {8108#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8108#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:34,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {8108#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {8109#(<= main_~i~0 6)} assume true; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {8109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {8109#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8109#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:34,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {8109#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {8110#(<= main_~i~0 7)} assume true; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {8110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {8110#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8110#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:34,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {8110#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {8111#(<= main_~i~0 8)} assume true; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {8111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {8111#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8111#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:34,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {8111#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {8112#(<= main_~i~0 9)} assume true; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {8112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {8112#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8112#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:34,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {8112#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {8113#(<= main_~i~0 10)} assume true; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {8113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {8113#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8113#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:34,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {8113#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= main_~i~0 11)} assume true; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8114#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:34,986 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,986 INFO L273 TraceCheckUtils]: 54: Hoare triple {8115#(<= main_~i~0 12)} assume true; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,987 INFO L273 TraceCheckUtils]: 55: Hoare triple {8115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,987 INFO L273 TraceCheckUtils]: 56: Hoare triple {8115#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8115#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:34,988 INFO L273 TraceCheckUtils]: 57: Hoare triple {8115#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,989 INFO L273 TraceCheckUtils]: 58: Hoare triple {8116#(<= main_~i~0 13)} assume true; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,989 INFO L273 TraceCheckUtils]: 59: Hoare triple {8116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,990 INFO L273 TraceCheckUtils]: 60: Hoare triple {8116#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8116#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:34,990 INFO L273 TraceCheckUtils]: 61: Hoare triple {8116#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,991 INFO L273 TraceCheckUtils]: 62: Hoare triple {8117#(<= main_~i~0 14)} assume true; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {8117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {8117#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8117#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:34,993 INFO L273 TraceCheckUtils]: 65: Hoare triple {8117#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,993 INFO L273 TraceCheckUtils]: 66: Hoare triple {8118#(<= main_~i~0 15)} assume true; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {8118#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,994 INFO L273 TraceCheckUtils]: 68: Hoare triple {8118#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8118#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:34,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {8118#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,996 INFO L273 TraceCheckUtils]: 70: Hoare triple {8119#(<= main_~i~0 16)} assume true; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,996 INFO L273 TraceCheckUtils]: 71: Hoare triple {8119#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {8119#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8119#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:34,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {8119#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8120#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:34,998 INFO L273 TraceCheckUtils]: 74: Hoare triple {8120#(<= main_~i~0 17)} assume true; {8120#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:34,999 INFO L273 TraceCheckUtils]: 75: Hoare triple {8120#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8102#false} is VALID [2018-11-14 16:57:34,999 INFO L273 TraceCheckUtils]: 76: Hoare triple {8102#false} havoc ~x~0;~x~0 := 0; {8102#false} is VALID [2018-11-14 16:57:34,999 INFO L273 TraceCheckUtils]: 77: Hoare triple {8102#false} assume true; {8102#false} is VALID [2018-11-14 16:57:34,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {8102#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {8102#false} is VALID [2018-11-14 16:57:35,000 INFO L256 TraceCheckUtils]: 79: Hoare triple {8102#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8102#false} is VALID [2018-11-14 16:57:35,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {8102#false} ~cond := #in~cond; {8102#false} is VALID [2018-11-14 16:57:35,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {8102#false} assume ~cond == 0; {8102#false} is VALID [2018-11-14 16:57:35,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {8102#false} assume !false; {8102#false} is VALID [2018-11-14 16:57:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:35,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:35,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 16:57:35,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-14 16:57:35,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:35,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:57:35,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:35,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:57:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:57:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:57:35,114 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 21 states. [2018-11-14 16:57:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:35,869 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-14 16:57:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:57:35,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-14 16:57:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:57:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2018-11-14 16:57:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:57:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2018-11-14 16:57:35,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 143 transitions. [2018-11-14 16:57:36,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:36,054 INFO L225 Difference]: With dead ends: 118 [2018-11-14 16:57:36,054 INFO L226 Difference]: Without dead ends: 100 [2018-11-14 16:57:36,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:57:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-14 16:57:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-14 16:57:36,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:36,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-14 16:57:36,072 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-14 16:57:36,072 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-14 16:57:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:36,074 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-11-14 16:57:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-14 16:57:36,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:36,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:36,075 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-14 16:57:36,075 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-14 16:57:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:36,077 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-11-14 16:57:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-14 16:57:36,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:36,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:36,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:36,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:57:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-14 16:57:36,080 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 83 [2018-11-14 16:57:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-14 16:57:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:57:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 16:57:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 16:57:36,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:36,082 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:36,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:36,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1312433296, now seen corresponding path program 18 times [2018-11-14 16:57:36,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:36,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:36,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2018-11-14 16:57:36,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8847#true} is VALID [2018-11-14 16:57:36,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2018-11-14 16:57:36,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #73#return; {8847#true} is VALID [2018-11-14 16:57:36,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret7 := main(); {8847#true} is VALID [2018-11-14 16:57:36,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {8847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8849#(= main_~i~0 0)} is VALID [2018-11-14 16:57:36,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {8849#(= main_~i~0 0)} assume true; {8849#(= main_~i~0 0)} is VALID [2018-11-14 16:57:36,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {8849#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8849#(= main_~i~0 0)} is VALID [2018-11-14 16:57:36,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {8849#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8849#(= main_~i~0 0)} is VALID [2018-11-14 16:57:36,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {8849#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:36,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {8850#(<= main_~i~0 1)} assume true; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:36,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {8850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:36,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {8850#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:36,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {8850#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:36,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {8851#(<= main_~i~0 2)} assume true; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:36,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {8851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:36,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {8851#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:36,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {8851#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:36,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {8852#(<= main_~i~0 3)} assume true; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:36,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {8852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:36,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {8852#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:36,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {8852#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:36,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {8853#(<= main_~i~0 4)} assume true; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:36,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {8853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:36,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {8853#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:36,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {8853#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:36,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {8854#(<= main_~i~0 5)} assume true; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:36,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {8854#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:36,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {8854#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:36,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {8854#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:36,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {8855#(<= main_~i~0 6)} assume true; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:36,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {8855#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:36,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {8855#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:36,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {8855#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:36,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {8856#(<= main_~i~0 7)} assume true; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:36,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {8856#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:36,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {8856#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:36,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {8856#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:36,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {8857#(<= main_~i~0 8)} assume true; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:36,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {8857#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:36,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {8857#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:36,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {8857#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:36,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {8858#(<= main_~i~0 9)} assume true; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:36,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {8858#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:36,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {8858#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:36,604 INFO L273 TraceCheckUtils]: 45: Hoare triple {8858#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:36,604 INFO L273 TraceCheckUtils]: 46: Hoare triple {8859#(<= main_~i~0 10)} assume true; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:36,604 INFO L273 TraceCheckUtils]: 47: Hoare triple {8859#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:36,605 INFO L273 TraceCheckUtils]: 48: Hoare triple {8859#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:36,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {8859#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:36,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {8860#(<= main_~i~0 11)} assume true; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:36,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {8860#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:36,607 INFO L273 TraceCheckUtils]: 52: Hoare triple {8860#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:36,608 INFO L273 TraceCheckUtils]: 53: Hoare triple {8860#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:36,608 INFO L273 TraceCheckUtils]: 54: Hoare triple {8861#(<= main_~i~0 12)} assume true; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:36,609 INFO L273 TraceCheckUtils]: 55: Hoare triple {8861#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:36,609 INFO L273 TraceCheckUtils]: 56: Hoare triple {8861#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:36,610 INFO L273 TraceCheckUtils]: 57: Hoare triple {8861#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:36,611 INFO L273 TraceCheckUtils]: 58: Hoare triple {8862#(<= main_~i~0 13)} assume true; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:36,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {8862#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:36,612 INFO L273 TraceCheckUtils]: 60: Hoare triple {8862#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:36,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {8862#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:36,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {8863#(<= main_~i~0 14)} assume true; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:36,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {8863#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:36,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {8863#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:36,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {8863#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:36,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {8864#(<= main_~i~0 15)} assume true; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:36,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {8864#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:36,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {8864#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:36,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {8864#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:36,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {8865#(<= main_~i~0 16)} assume true; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:36,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {8865#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:36,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {8865#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:36,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {8865#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:36,620 INFO L273 TraceCheckUtils]: 74: Hoare triple {8866#(<= main_~i~0 17)} assume true; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:36,620 INFO L273 TraceCheckUtils]: 75: Hoare triple {8866#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:36,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {8866#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:36,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {8866#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8867#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:36,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {8867#(<= main_~i~0 18)} assume true; {8867#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:36,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {8867#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8848#false} is VALID [2018-11-14 16:57:36,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {8848#false} havoc ~x~0;~x~0 := 0; {8848#false} is VALID [2018-11-14 16:57:36,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {8848#false} assume true; {8848#false} is VALID [2018-11-14 16:57:36,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {8848#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {8848#false} is VALID [2018-11-14 16:57:36,624 INFO L256 TraceCheckUtils]: 83: Hoare triple {8848#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8848#false} is VALID [2018-11-14 16:57:36,624 INFO L273 TraceCheckUtils]: 84: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2018-11-14 16:57:36,624 INFO L273 TraceCheckUtils]: 85: Hoare triple {8848#false} assume ~cond == 0; {8848#false} is VALID [2018-11-14 16:57:36,624 INFO L273 TraceCheckUtils]: 86: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2018-11-14 16:57:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:36,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:36,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:57:37,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 16:57:37,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:37,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:37,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2018-11-14 16:57:37,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8847#true} is VALID [2018-11-14 16:57:37,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2018-11-14 16:57:37,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #73#return; {8847#true} is VALID [2018-11-14 16:57:37,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret7 := main(); {8847#true} is VALID [2018-11-14 16:57:37,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {8847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8886#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:37,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {8886#(<= main_~i~0 0)} assume true; {8886#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:37,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {8886#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8886#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:37,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {8886#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8886#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:37,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {8886#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:37,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {8850#(<= main_~i~0 1)} assume true; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:37,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {8850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:37,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {8850#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8850#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:37,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {8850#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:37,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {8851#(<= main_~i~0 2)} assume true; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:37,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {8851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:37,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {8851#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8851#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:37,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {8851#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:37,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {8852#(<= main_~i~0 3)} assume true; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:37,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {8852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:37,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {8852#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8852#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:37,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {8852#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:37,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {8853#(<= main_~i~0 4)} assume true; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:37,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {8853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:37,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {8853#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8853#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:37,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {8853#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:37,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {8854#(<= main_~i~0 5)} assume true; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:37,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {8854#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:37,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {8854#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8854#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:37,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {8854#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:37,309 INFO L273 TraceCheckUtils]: 30: Hoare triple {8855#(<= main_~i~0 6)} assume true; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:37,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {8855#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:37,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {8855#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8855#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:37,310 INFO L273 TraceCheckUtils]: 33: Hoare triple {8855#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:37,311 INFO L273 TraceCheckUtils]: 34: Hoare triple {8856#(<= main_~i~0 7)} assume true; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:37,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {8856#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:37,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {8856#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8856#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:37,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {8856#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:37,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {8857#(<= main_~i~0 8)} assume true; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:37,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {8857#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:37,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {8857#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8857#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:37,315 INFO L273 TraceCheckUtils]: 41: Hoare triple {8857#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:37,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {8858#(<= main_~i~0 9)} assume true; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:37,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {8858#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:37,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {8858#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8858#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:37,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {8858#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:37,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {8859#(<= main_~i~0 10)} assume true; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:37,318 INFO L273 TraceCheckUtils]: 47: Hoare triple {8859#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:37,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {8859#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8859#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:37,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {8859#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:37,320 INFO L273 TraceCheckUtils]: 50: Hoare triple {8860#(<= main_~i~0 11)} assume true; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:37,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {8860#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:37,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {8860#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8860#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:37,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {8860#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:37,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {8861#(<= main_~i~0 12)} assume true; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:37,322 INFO L273 TraceCheckUtils]: 55: Hoare triple {8861#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:37,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {8861#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8861#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:37,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {8861#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:37,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {8862#(<= main_~i~0 13)} assume true; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:37,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {8862#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:37,325 INFO L273 TraceCheckUtils]: 60: Hoare triple {8862#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8862#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:37,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {8862#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:37,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {8863#(<= main_~i~0 14)} assume true; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:37,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {8863#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:37,328 INFO L273 TraceCheckUtils]: 64: Hoare triple {8863#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8863#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:37,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {8863#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:37,329 INFO L273 TraceCheckUtils]: 66: Hoare triple {8864#(<= main_~i~0 15)} assume true; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:37,329 INFO L273 TraceCheckUtils]: 67: Hoare triple {8864#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:37,330 INFO L273 TraceCheckUtils]: 68: Hoare triple {8864#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8864#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:37,330 INFO L273 TraceCheckUtils]: 69: Hoare triple {8864#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:37,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {8865#(<= main_~i~0 16)} assume true; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:37,331 INFO L273 TraceCheckUtils]: 71: Hoare triple {8865#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:37,332 INFO L273 TraceCheckUtils]: 72: Hoare triple {8865#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8865#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:37,333 INFO L273 TraceCheckUtils]: 73: Hoare triple {8865#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:37,333 INFO L273 TraceCheckUtils]: 74: Hoare triple {8866#(<= main_~i~0 17)} assume true; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:37,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {8866#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:37,334 INFO L273 TraceCheckUtils]: 76: Hoare triple {8866#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {8866#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:37,335 INFO L273 TraceCheckUtils]: 77: Hoare triple {8866#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8867#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:37,336 INFO L273 TraceCheckUtils]: 78: Hoare triple {8867#(<= main_~i~0 18)} assume true; {8867#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:37,336 INFO L273 TraceCheckUtils]: 79: Hoare triple {8867#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8848#false} is VALID [2018-11-14 16:57:37,336 INFO L273 TraceCheckUtils]: 80: Hoare triple {8848#false} havoc ~x~0;~x~0 := 0; {8848#false} is VALID [2018-11-14 16:57:37,337 INFO L273 TraceCheckUtils]: 81: Hoare triple {8848#false} assume true; {8848#false} is VALID [2018-11-14 16:57:37,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {8848#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {8848#false} is VALID [2018-11-14 16:57:37,337 INFO L256 TraceCheckUtils]: 83: Hoare triple {8848#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8848#false} is VALID [2018-11-14 16:57:37,337 INFO L273 TraceCheckUtils]: 84: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2018-11-14 16:57:37,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {8848#false} assume ~cond == 0; {8848#false} is VALID [2018-11-14 16:57:37,338 INFO L273 TraceCheckUtils]: 86: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2018-11-14 16:57:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:37,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:37,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 16:57:37,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-14 16:57:37,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:37,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 16:57:37,463 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:57:37,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 16:57:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 16:57:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:57:37,464 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 22 states. [2018-11-14 16:57:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:38,184 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2018-11-14 16:57:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:57:38,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-14 16:57:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:57:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-14 16:57:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:57:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-14 16:57:38,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 148 transitions. [2018-11-14 16:57:38,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:38,348 INFO L225 Difference]: With dead ends: 122 [2018-11-14 16:57:38,348 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 16:57:38,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:57:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 16:57:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-14 16:57:38,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:38,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-14 16:57:38,369 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-14 16:57:38,370 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-14 16:57:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:38,372 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-14 16:57:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-14 16:57:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:38,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:38,373 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-14 16:57:38,373 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-14 16:57:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:38,374 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-14 16:57:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-14 16:57:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:38,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:38,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:38,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-14 16:57:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-14 16:57:38,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 87 [2018-11-14 16:57:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:38,377 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-14 16:57:38,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 16:57:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-14 16:57:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 16:57:38,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:38,377 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:38,378 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:38,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 13194887, now seen corresponding path program 19 times [2018-11-14 16:57:38,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:38,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:38,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:39,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {9624#true} call ULTIMATE.init(); {9624#true} is VALID [2018-11-14 16:57:39,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {9624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9624#true} is VALID [2018-11-14 16:57:39,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {9624#true} assume true; {9624#true} is VALID [2018-11-14 16:57:39,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9624#true} {9624#true} #73#return; {9624#true} is VALID [2018-11-14 16:57:39,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {9624#true} call #t~ret7 := main(); {9624#true} is VALID [2018-11-14 16:57:39,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {9624#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9626#(= main_~i~0 0)} is VALID [2018-11-14 16:57:39,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {9626#(= main_~i~0 0)} assume true; {9626#(= main_~i~0 0)} is VALID [2018-11-14 16:57:39,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {9626#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9626#(= main_~i~0 0)} is VALID [2018-11-14 16:57:39,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {9626#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9626#(= main_~i~0 0)} is VALID [2018-11-14 16:57:39,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {9626#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {9627#(<= main_~i~0 1)} assume true; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {9627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {9627#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {9627#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {9628#(<= main_~i~0 2)} assume true; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {9628#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {9628#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {9628#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {9629#(<= main_~i~0 3)} assume true; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {9629#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {9629#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {9629#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {9630#(<= main_~i~0 4)} assume true; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {9630#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {9630#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {9630#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {9631#(<= main_~i~0 5)} assume true; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {9631#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {9631#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {9631#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {9632#(<= main_~i~0 6)} assume true; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {9632#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {9632#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {9632#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {9633#(<= main_~i~0 7)} assume true; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {9633#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {9633#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {9633#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {9634#(<= main_~i~0 8)} assume true; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {9634#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {9634#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {9634#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(<= main_~i~0 9)} assume true; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {9636#(<= main_~i~0 10)} assume true; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {9636#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {9636#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {9636#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {9637#(<= main_~i~0 11)} assume true; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {9637#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {9637#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {9637#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {9638#(<= main_~i~0 12)} assume true; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {9638#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {9638#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {9638#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {9639#(<= main_~i~0 13)} assume true; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {9639#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {9639#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {9639#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {9640#(<= main_~i~0 14)} assume true; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {9640#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {9640#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {9640#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {9641#(<= main_~i~0 15)} assume true; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {9641#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {9641#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {9641#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {9642#(<= main_~i~0 16)} assume true; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {9642#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,432 INFO L273 TraceCheckUtils]: 72: Hoare triple {9642#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,433 INFO L273 TraceCheckUtils]: 73: Hoare triple {9642#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,433 INFO L273 TraceCheckUtils]: 74: Hoare triple {9643#(<= main_~i~0 17)} assume true; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,434 INFO L273 TraceCheckUtils]: 75: Hoare triple {9643#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,434 INFO L273 TraceCheckUtils]: 76: Hoare triple {9643#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,435 INFO L273 TraceCheckUtils]: 77: Hoare triple {9643#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,435 INFO L273 TraceCheckUtils]: 78: Hoare triple {9644#(<= main_~i~0 18)} assume true; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,436 INFO L273 TraceCheckUtils]: 79: Hoare triple {9644#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,436 INFO L273 TraceCheckUtils]: 80: Hoare triple {9644#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,437 INFO L273 TraceCheckUtils]: 81: Hoare triple {9644#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9645#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:39,438 INFO L273 TraceCheckUtils]: 82: Hoare triple {9645#(<= main_~i~0 19)} assume true; {9645#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:39,438 INFO L273 TraceCheckUtils]: 83: Hoare triple {9645#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9625#false} is VALID [2018-11-14 16:57:39,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {9625#false} havoc ~x~0;~x~0 := 0; {9625#false} is VALID [2018-11-14 16:57:39,439 INFO L273 TraceCheckUtils]: 85: Hoare triple {9625#false} assume true; {9625#false} is VALID [2018-11-14 16:57:39,439 INFO L273 TraceCheckUtils]: 86: Hoare triple {9625#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {9625#false} is VALID [2018-11-14 16:57:39,439 INFO L256 TraceCheckUtils]: 87: Hoare triple {9625#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9625#false} is VALID [2018-11-14 16:57:39,439 INFO L273 TraceCheckUtils]: 88: Hoare triple {9625#false} ~cond := #in~cond; {9625#false} is VALID [2018-11-14 16:57:39,440 INFO L273 TraceCheckUtils]: 89: Hoare triple {9625#false} assume ~cond == 0; {9625#false} is VALID [2018-11-14 16:57:39,440 INFO L273 TraceCheckUtils]: 90: Hoare triple {9625#false} assume !false; {9625#false} is VALID [2018-11-14 16:57:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:39,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:39,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:39,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:39,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {9624#true} call ULTIMATE.init(); {9624#true} is VALID [2018-11-14 16:57:39,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {9624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9624#true} is VALID [2018-11-14 16:57:39,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {9624#true} assume true; {9624#true} is VALID [2018-11-14 16:57:39,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9624#true} {9624#true} #73#return; {9624#true} is VALID [2018-11-14 16:57:39,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {9624#true} call #t~ret7 := main(); {9624#true} is VALID [2018-11-14 16:57:39,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {9624#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9664#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:39,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {9664#(<= main_~i~0 0)} assume true; {9664#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:39,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {9664#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9664#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:39,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {9664#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9664#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:39,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {9664#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {9627#(<= main_~i~0 1)} assume true; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {9627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {9627#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9627#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:39,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {9627#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {9628#(<= main_~i~0 2)} assume true; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {9628#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {9628#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9628#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:39,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {9628#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {9629#(<= main_~i~0 3)} assume true; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {9629#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {9629#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9629#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:39,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {9629#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {9630#(<= main_~i~0 4)} assume true; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {9630#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {9630#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9630#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:39,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {9630#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {9631#(<= main_~i~0 5)} assume true; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {9631#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {9631#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9631#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:39,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {9631#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {9632#(<= main_~i~0 6)} assume true; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {9632#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {9632#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9632#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:39,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {9632#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {9633#(<= main_~i~0 7)} assume true; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {9633#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {9633#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9633#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:39,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {9633#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {9634#(<= main_~i~0 8)} assume true; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {9634#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {9634#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9634#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:39,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {9634#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(<= main_~i~0 9)} assume true; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9635#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:39,739 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {9636#(<= main_~i~0 10)} assume true; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {9636#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {9636#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9636#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:39,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {9636#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {9637#(<= main_~i~0 11)} assume true; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {9637#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {9637#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9637#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:39,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {9637#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {9638#(<= main_~i~0 12)} assume true; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {9638#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {9638#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9638#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:39,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {9638#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {9639#(<= main_~i~0 13)} assume true; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {9639#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {9639#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9639#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:39,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {9639#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {9640#(<= main_~i~0 14)} assume true; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {9640#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {9640#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9640#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:39,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {9640#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {9641#(<= main_~i~0 15)} assume true; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {9641#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {9641#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9641#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:39,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {9641#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {9642#(<= main_~i~0 16)} assume true; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {9642#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {9642#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9642#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:39,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {9642#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {9643#(<= main_~i~0 17)} assume true; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,755 INFO L273 TraceCheckUtils]: 75: Hoare triple {9643#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {9643#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9643#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:39,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {9643#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {9644#(<= main_~i~0 18)} assume true; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {9644#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {9644#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {9644#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:39,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {9644#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9645#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:39,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {9645#(<= main_~i~0 19)} assume true; {9645#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:39,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {9645#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9625#false} is VALID [2018-11-14 16:57:39,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {9625#false} havoc ~x~0;~x~0 := 0; {9625#false} is VALID [2018-11-14 16:57:39,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {9625#false} assume true; {9625#false} is VALID [2018-11-14 16:57:39,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {9625#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {9625#false} is VALID [2018-11-14 16:57:39,761 INFO L256 TraceCheckUtils]: 87: Hoare triple {9625#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9625#false} is VALID [2018-11-14 16:57:39,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {9625#false} ~cond := #in~cond; {9625#false} is VALID [2018-11-14 16:57:39,761 INFO L273 TraceCheckUtils]: 89: Hoare triple {9625#false} assume ~cond == 0; {9625#false} is VALID [2018-11-14 16:57:39,762 INFO L273 TraceCheckUtils]: 90: Hoare triple {9625#false} assume !false; {9625#false} is VALID [2018-11-14 16:57:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:39,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:39,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 16:57:39,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-14 16:57:39,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:39,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:57:39,882 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:57:39,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:57:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:57:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:57:39,883 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 23 states. [2018-11-14 16:57:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:40,359 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2018-11-14 16:57:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:57:40,359 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-14 16:57:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:57:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. [2018-11-14 16:57:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:57:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. [2018-11-14 16:57:40,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 153 transitions. [2018-11-14 16:57:40,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:40,502 INFO L225 Difference]: With dead ends: 126 [2018-11-14 16:57:40,502 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 16:57:40,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:57:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 16:57:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-14 16:57:40,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:40,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 106 states. [2018-11-14 16:57:40,525 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 106 states. [2018-11-14 16:57:40,525 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 106 states. [2018-11-14 16:57:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:40,528 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 16:57:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 16:57:40,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:40,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:40,529 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 108 states. [2018-11-14 16:57:40,529 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 108 states. [2018-11-14 16:57:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:40,531 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 16:57:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 16:57:40,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:40,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:40,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:40,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-14 16:57:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-11-14 16:57:40,534 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 91 [2018-11-14 16:57:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:40,534 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2018-11-14 16:57:40,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:57:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 16:57:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-14 16:57:40,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:40,535 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:40,536 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:40,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -589599202, now seen corresponding path program 20 times [2018-11-14 16:57:40,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:41,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-14 16:57:41,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {10432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10432#true} is VALID [2018-11-14 16:57:41,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-14 16:57:41,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #73#return; {10432#true} is VALID [2018-11-14 16:57:41,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret7 := main(); {10432#true} is VALID [2018-11-14 16:57:41,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {10432#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10434#(= main_~i~0 0)} is VALID [2018-11-14 16:57:41,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {10434#(= main_~i~0 0)} assume true; {10434#(= main_~i~0 0)} is VALID [2018-11-14 16:57:41,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {10434#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10434#(= main_~i~0 0)} is VALID [2018-11-14 16:57:41,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {10434#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10434#(= main_~i~0 0)} is VALID [2018-11-14 16:57:41,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {10434#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {10435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {10435#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {10435#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {10436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {10436#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {10436#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {10437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {10437#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {10437#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {10438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {10438#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {10438#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {10439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {10439#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {10439#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {10440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {10440#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {10440#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {10441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {10441#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {10441#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {10442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {10442#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {10442#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,275 INFO L273 TraceCheckUtils]: 42: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,275 INFO L273 TraceCheckUtils]: 43: Hoare triple {10443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,276 INFO L273 TraceCheckUtils]: 44: Hoare triple {10443#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,276 INFO L273 TraceCheckUtils]: 45: Hoare triple {10443#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,277 INFO L273 TraceCheckUtils]: 46: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,277 INFO L273 TraceCheckUtils]: 47: Hoare triple {10444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {10444#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {10444#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {10445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {10445#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {10445#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {10446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {10446#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {10446#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {10447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {10447#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {10447#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,287 INFO L273 TraceCheckUtils]: 63: Hoare triple {10448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,287 INFO L273 TraceCheckUtils]: 64: Hoare triple {10448#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,288 INFO L273 TraceCheckUtils]: 65: Hoare triple {10448#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,288 INFO L273 TraceCheckUtils]: 66: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,289 INFO L273 TraceCheckUtils]: 67: Hoare triple {10449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,289 INFO L273 TraceCheckUtils]: 68: Hoare triple {10449#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,290 INFO L273 TraceCheckUtils]: 69: Hoare triple {10449#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,291 INFO L273 TraceCheckUtils]: 70: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,291 INFO L273 TraceCheckUtils]: 71: Hoare triple {10450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,292 INFO L273 TraceCheckUtils]: 72: Hoare triple {10450#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,292 INFO L273 TraceCheckUtils]: 73: Hoare triple {10450#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,293 INFO L273 TraceCheckUtils]: 74: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {10451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {10451#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,295 INFO L273 TraceCheckUtils]: 77: Hoare triple {10451#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,296 INFO L273 TraceCheckUtils]: 79: Hoare triple {10452#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,296 INFO L273 TraceCheckUtils]: 80: Hoare triple {10452#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,297 INFO L273 TraceCheckUtils]: 81: Hoare triple {10452#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,298 INFO L273 TraceCheckUtils]: 82: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,298 INFO L273 TraceCheckUtils]: 83: Hoare triple {10453#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,299 INFO L273 TraceCheckUtils]: 84: Hoare triple {10453#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,299 INFO L273 TraceCheckUtils]: 85: Hoare triple {10453#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:41,300 INFO L273 TraceCheckUtils]: 86: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:41,301 INFO L273 TraceCheckUtils]: 87: Hoare triple {10454#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 16:57:41,301 INFO L273 TraceCheckUtils]: 88: Hoare triple {10433#false} havoc ~x~0;~x~0 := 0; {10433#false} is VALID [2018-11-14 16:57:41,301 INFO L273 TraceCheckUtils]: 89: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:57:41,301 INFO L273 TraceCheckUtils]: 90: Hoare triple {10433#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {10433#false} is VALID [2018-11-14 16:57:41,301 INFO L256 TraceCheckUtils]: 91: Hoare triple {10433#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10433#false} is VALID [2018-11-14 16:57:41,302 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-14 16:57:41,302 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume ~cond == 0; {10433#false} is VALID [2018-11-14 16:57:41,302 INFO L273 TraceCheckUtils]: 94: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-14 16:57:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:41,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:57:41,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:57:41,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:41,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:41,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-14 16:57:41,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {10432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10432#true} is VALID [2018-11-14 16:57:41,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-14 16:57:41,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #73#return; {10432#true} is VALID [2018-11-14 16:57:41,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret7 := main(); {10432#true} is VALID [2018-11-14 16:57:41,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {10432#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10473#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:41,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {10473#(<= main_~i~0 0)} assume true; {10473#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:41,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {10473#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10473#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:41,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {10473#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10473#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:41,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {10473#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {10435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {10435#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10435#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:41,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {10435#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {10436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {10436#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10436#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:41,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {10436#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {10437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {10437#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10437#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:41,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {10437#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {10438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {10438#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10438#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:41,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {10438#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {10439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {10439#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10439#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:41,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {10439#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {10440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {10440#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10440#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:41,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {10440#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {10441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {10441#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10441#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:41,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {10441#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,615 INFO L273 TraceCheckUtils]: 39: Hoare triple {10442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {10442#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10442#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:41,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {10442#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {10443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {10443#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10443#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:41,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {10443#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {10444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,620 INFO L273 TraceCheckUtils]: 48: Hoare triple {10444#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10444#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:41,621 INFO L273 TraceCheckUtils]: 49: Hoare triple {10444#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {10445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {10445#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10445#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:41,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {10445#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {10446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {10446#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10446#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:41,625 INFO L273 TraceCheckUtils]: 57: Hoare triple {10446#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {10447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {10447#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10447#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:41,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {10447#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,628 INFO L273 TraceCheckUtils]: 62: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,628 INFO L273 TraceCheckUtils]: 63: Hoare triple {10448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,629 INFO L273 TraceCheckUtils]: 64: Hoare triple {10448#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10448#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:41,629 INFO L273 TraceCheckUtils]: 65: Hoare triple {10448#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,630 INFO L273 TraceCheckUtils]: 67: Hoare triple {10449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,631 INFO L273 TraceCheckUtils]: 68: Hoare triple {10449#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10449#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:41,632 INFO L273 TraceCheckUtils]: 69: Hoare triple {10449#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,632 INFO L273 TraceCheckUtils]: 70: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,633 INFO L273 TraceCheckUtils]: 71: Hoare triple {10450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,633 INFO L273 TraceCheckUtils]: 72: Hoare triple {10450#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10450#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:41,634 INFO L273 TraceCheckUtils]: 73: Hoare triple {10450#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,634 INFO L273 TraceCheckUtils]: 74: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,635 INFO L273 TraceCheckUtils]: 75: Hoare triple {10451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,635 INFO L273 TraceCheckUtils]: 76: Hoare triple {10451#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10451#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:41,636 INFO L273 TraceCheckUtils]: 77: Hoare triple {10451#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,636 INFO L273 TraceCheckUtils]: 78: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,637 INFO L273 TraceCheckUtils]: 79: Hoare triple {10452#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,637 INFO L273 TraceCheckUtils]: 80: Hoare triple {10452#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10452#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:41,638 INFO L273 TraceCheckUtils]: 81: Hoare triple {10452#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,639 INFO L273 TraceCheckUtils]: 82: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,639 INFO L273 TraceCheckUtils]: 83: Hoare triple {10453#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,639 INFO L273 TraceCheckUtils]: 84: Hoare triple {10453#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {10453#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:41,640 INFO L273 TraceCheckUtils]: 85: Hoare triple {10453#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:41,641 INFO L273 TraceCheckUtils]: 86: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:41,641 INFO L273 TraceCheckUtils]: 87: Hoare triple {10454#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L273 TraceCheckUtils]: 88: Hoare triple {10433#false} havoc ~x~0;~x~0 := 0; {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L273 TraceCheckUtils]: 89: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L273 TraceCheckUtils]: 90: Hoare triple {10433#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L256 TraceCheckUtils]: 91: Hoare triple {10433#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-14 16:57:41,642 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume ~cond == 0; {10433#false} is VALID [2018-11-14 16:57:41,643 INFO L273 TraceCheckUtils]: 94: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-14 16:57:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:41,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:41,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 16:57:41,670 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-14 16:57:41,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:41,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:57:41,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:57:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:57:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:57:41,802 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 24 states. [2018-11-14 16:57:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:42,397 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-14 16:57:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 16:57:42,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-14 16:57:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:57:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-14 16:57:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:57:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-14 16:57:42,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 158 transitions. [2018-11-14 16:57:42,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:42,546 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:57:42,546 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 16:57:42,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:57:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 16:57:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-14 16:57:42,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:42,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2018-11-14 16:57:42,581 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2018-11-14 16:57:42,581 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2018-11-14 16:57:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:42,582 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 16:57:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-14 16:57:42,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:42,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:42,583 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2018-11-14 16:57:42,583 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2018-11-14 16:57:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:42,585 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 16:57:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-14 16:57:42,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:42,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:42,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:42,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 16:57:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-14 16:57:42,587 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 95 [2018-11-14 16:57:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:42,587 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-14 16:57:42,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:57:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-14 16:57:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 16:57:42,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:42,588 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:42,588 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:42,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1403395531, now seen corresponding path program 21 times [2018-11-14 16:57:42,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:42,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:44,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-14 16:57:44,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-14 16:57:44,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-14 16:57:44,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #73#return; {11271#true} is VALID [2018-11-14 16:57:44,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret7 := main(); {11271#true} is VALID [2018-11-14 16:57:44,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11273#(= main_~i~0 0)} is VALID [2018-11-14 16:57:44,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {11273#(= main_~i~0 0)} assume true; {11273#(= main_~i~0 0)} is VALID [2018-11-14 16:57:44,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {11273#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11273#(= main_~i~0 0)} is VALID [2018-11-14 16:57:44,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {11273#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11273#(= main_~i~0 0)} is VALID [2018-11-14 16:57:44,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {11273#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:44,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {11274#(<= main_~i~0 1)} assume true; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:44,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {11274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:44,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {11274#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:44,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {11274#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:44,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {11275#(<= main_~i~0 2)} assume true; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:44,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {11275#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:44,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:44,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:44,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 3)} assume true; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:44,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:44,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {11276#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:44,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:44,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#(<= main_~i~0 4)} assume true; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:44,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:44,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:44,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:44,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {11278#(<= main_~i~0 5)} assume true; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:44,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {11278#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:44,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {11278#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:44,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {11278#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:44,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {11279#(<= main_~i~0 6)} assume true; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:44,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {11279#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:44,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {11279#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:44,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {11279#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:44,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {11280#(<= main_~i~0 7)} assume true; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:44,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {11280#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:44,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:44,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {11280#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:44,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {11281#(<= main_~i~0 8)} assume true; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:44,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {11281#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:44,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {11281#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:44,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {11281#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:44,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {11282#(<= main_~i~0 9)} assume true; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:44,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {11282#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:44,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:44,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:44,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 10)} assume true; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:44,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:44,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {11283#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:44,327 INFO L273 TraceCheckUtils]: 49: Hoare triple {11283#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:44,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {11284#(<= main_~i~0 11)} assume true; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:44,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {11284#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:44,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {11284#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:44,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {11284#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:44,330 INFO L273 TraceCheckUtils]: 54: Hoare triple {11285#(<= main_~i~0 12)} assume true; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:44,330 INFO L273 TraceCheckUtils]: 55: Hoare triple {11285#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:44,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {11285#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:44,331 INFO L273 TraceCheckUtils]: 57: Hoare triple {11285#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:44,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {11286#(<= main_~i~0 13)} assume true; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:44,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {11286#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:44,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {11286#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:44,334 INFO L273 TraceCheckUtils]: 61: Hoare triple {11286#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:44,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {11287#(<= main_~i~0 14)} assume true; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:44,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {11287#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:44,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {11287#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:44,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {11287#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:44,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {11288#(<= main_~i~0 15)} assume true; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:44,337 INFO L273 TraceCheckUtils]: 67: Hoare triple {11288#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:44,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {11288#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:44,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {11288#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:44,339 INFO L273 TraceCheckUtils]: 70: Hoare triple {11289#(<= main_~i~0 16)} assume true; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:44,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {11289#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:44,340 INFO L273 TraceCheckUtils]: 72: Hoare triple {11289#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:44,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {11289#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:44,341 INFO L273 TraceCheckUtils]: 74: Hoare triple {11290#(<= main_~i~0 17)} assume true; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:44,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {11290#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:44,342 INFO L273 TraceCheckUtils]: 76: Hoare triple {11290#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:44,343 INFO L273 TraceCheckUtils]: 77: Hoare triple {11290#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:44,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {11291#(<= main_~i~0 18)} assume true; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:44,344 INFO L273 TraceCheckUtils]: 79: Hoare triple {11291#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:44,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {11291#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:44,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {11291#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:44,345 INFO L273 TraceCheckUtils]: 82: Hoare triple {11292#(<= main_~i~0 19)} assume true; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:44,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {11292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:44,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {11292#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:44,347 INFO L273 TraceCheckUtils]: 85: Hoare triple {11292#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:44,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {11293#(<= main_~i~0 20)} assume true; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:44,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {11293#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:44,349 INFO L273 TraceCheckUtils]: 88: Hoare triple {11293#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:44,349 INFO L273 TraceCheckUtils]: 89: Hoare triple {11293#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11294#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:44,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {11294#(<= main_~i~0 21)} assume true; {11294#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:44,350 INFO L273 TraceCheckUtils]: 91: Hoare triple {11294#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-14 16:57:44,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {11272#false} havoc ~x~0;~x~0 := 0; {11272#false} is VALID [2018-11-14 16:57:44,351 INFO L273 TraceCheckUtils]: 93: Hoare triple {11272#false} assume true; {11272#false} is VALID [2018-11-14 16:57:44,351 INFO L273 TraceCheckUtils]: 94: Hoare triple {11272#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {11272#false} is VALID [2018-11-14 16:57:44,351 INFO L256 TraceCheckUtils]: 95: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11272#false} is VALID [2018-11-14 16:57:44,351 INFO L273 TraceCheckUtils]: 96: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-14 16:57:44,352 INFO L273 TraceCheckUtils]: 97: Hoare triple {11272#false} assume ~cond == 0; {11272#false} is VALID [2018-11-14 16:57:44,352 INFO L273 TraceCheckUtils]: 98: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-14 16:57:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:44,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:44,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:44,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:57:45,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 16:57:45,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:45,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:45,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-14 16:57:45,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-14 16:57:45,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-14 16:57:45,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #73#return; {11271#true} is VALID [2018-11-14 16:57:45,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret7 := main(); {11271#true} is VALID [2018-11-14 16:57:45,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11313#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:45,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {11313#(<= main_~i~0 0)} assume true; {11313#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:45,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {11313#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11313#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:45,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {11313#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11313#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:45,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {11313#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:45,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {11274#(<= main_~i~0 1)} assume true; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:45,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {11274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:45,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {11274#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11274#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:45,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {11274#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:45,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {11275#(<= main_~i~0 2)} assume true; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:45,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {11275#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:45,254 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11275#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:45,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:45,255 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 3)} assume true; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:45,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:45,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {11276#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11276#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:45,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:45,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#(<= main_~i~0 4)} assume true; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:45,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:45,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11277#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:45,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:45,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {11278#(<= main_~i~0 5)} assume true; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:45,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {11278#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:45,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {11278#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11278#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:45,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {11278#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:45,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {11279#(<= main_~i~0 6)} assume true; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:45,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {11279#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:45,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {11279#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11279#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:45,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {11279#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:45,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {11280#(<= main_~i~0 7)} assume true; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:45,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {11280#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:45,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11280#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:45,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {11280#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:45,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {11281#(<= main_~i~0 8)} assume true; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:45,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {11281#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:45,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {11281#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11281#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:45,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {11281#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:45,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {11282#(<= main_~i~0 9)} assume true; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:45,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {11282#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:45,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11282#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:45,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:45,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 10)} assume true; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:45,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:45,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {11283#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11283#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:45,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {11283#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:45,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {11284#(<= main_~i~0 11)} assume true; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:45,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {11284#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:45,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {11284#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11284#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:45,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {11284#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:45,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {11285#(<= main_~i~0 12)} assume true; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:45,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {11285#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:45,275 INFO L273 TraceCheckUtils]: 56: Hoare triple {11285#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11285#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:45,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {11285#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:45,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {11286#(<= main_~i~0 13)} assume true; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:45,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {11286#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:45,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {11286#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11286#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:45,278 INFO L273 TraceCheckUtils]: 61: Hoare triple {11286#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:45,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {11287#(<= main_~i~0 14)} assume true; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:45,279 INFO L273 TraceCheckUtils]: 63: Hoare triple {11287#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:45,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {11287#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11287#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:45,280 INFO L273 TraceCheckUtils]: 65: Hoare triple {11287#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:45,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {11288#(<= main_~i~0 15)} assume true; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:45,281 INFO L273 TraceCheckUtils]: 67: Hoare triple {11288#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:45,282 INFO L273 TraceCheckUtils]: 68: Hoare triple {11288#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11288#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:45,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {11288#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:45,283 INFO L273 TraceCheckUtils]: 70: Hoare triple {11289#(<= main_~i~0 16)} assume true; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:45,284 INFO L273 TraceCheckUtils]: 71: Hoare triple {11289#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:45,284 INFO L273 TraceCheckUtils]: 72: Hoare triple {11289#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11289#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:45,285 INFO L273 TraceCheckUtils]: 73: Hoare triple {11289#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:45,285 INFO L273 TraceCheckUtils]: 74: Hoare triple {11290#(<= main_~i~0 17)} assume true; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:45,286 INFO L273 TraceCheckUtils]: 75: Hoare triple {11290#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:45,286 INFO L273 TraceCheckUtils]: 76: Hoare triple {11290#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11290#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:45,287 INFO L273 TraceCheckUtils]: 77: Hoare triple {11290#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:45,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {11291#(<= main_~i~0 18)} assume true; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:45,288 INFO L273 TraceCheckUtils]: 79: Hoare triple {11291#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:45,288 INFO L273 TraceCheckUtils]: 80: Hoare triple {11291#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11291#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:45,289 INFO L273 TraceCheckUtils]: 81: Hoare triple {11291#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:45,289 INFO L273 TraceCheckUtils]: 82: Hoare triple {11292#(<= main_~i~0 19)} assume true; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:45,290 INFO L273 TraceCheckUtils]: 83: Hoare triple {11292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:45,290 INFO L273 TraceCheckUtils]: 84: Hoare triple {11292#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11292#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:45,291 INFO L273 TraceCheckUtils]: 85: Hoare triple {11292#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:45,292 INFO L273 TraceCheckUtils]: 86: Hoare triple {11293#(<= main_~i~0 20)} assume true; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:45,292 INFO L273 TraceCheckUtils]: 87: Hoare triple {11293#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:45,293 INFO L273 TraceCheckUtils]: 88: Hoare triple {11293#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {11293#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:45,293 INFO L273 TraceCheckUtils]: 89: Hoare triple {11293#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11294#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:45,294 INFO L273 TraceCheckUtils]: 90: Hoare triple {11294#(<= main_~i~0 21)} assume true; {11294#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:45,294 INFO L273 TraceCheckUtils]: 91: Hoare triple {11294#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-14 16:57:45,295 INFO L273 TraceCheckUtils]: 92: Hoare triple {11272#false} havoc ~x~0;~x~0 := 0; {11272#false} is VALID [2018-11-14 16:57:45,295 INFO L273 TraceCheckUtils]: 93: Hoare triple {11272#false} assume true; {11272#false} is VALID [2018-11-14 16:57:45,295 INFO L273 TraceCheckUtils]: 94: Hoare triple {11272#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {11272#false} is VALID [2018-11-14 16:57:45,295 INFO L256 TraceCheckUtils]: 95: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11272#false} is VALID [2018-11-14 16:57:45,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-14 16:57:45,296 INFO L273 TraceCheckUtils]: 97: Hoare triple {11272#false} assume ~cond == 0; {11272#false} is VALID [2018-11-14 16:57:45,296 INFO L273 TraceCheckUtils]: 98: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-14 16:57:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:45,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:45,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 16:57:45,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-14 16:57:45,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:45,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:57:45,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:45,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:57:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:57:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:57:45,420 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 25 states. [2018-11-14 16:57:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:46,384 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2018-11-14 16:57:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:57:46,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-14 16:57:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:57:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-11-14 16:57:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:57:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-11-14 16:57:46,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 163 transitions. [2018-11-14 16:57:46,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:46,580 INFO L225 Difference]: With dead ends: 134 [2018-11-14 16:57:46,580 INFO L226 Difference]: Without dead ends: 116 [2018-11-14 16:57:46,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:57:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-14 16:57:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-14 16:57:46,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:46,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-14 16:57:46,610 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-14 16:57:46,610 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-14 16:57:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:46,612 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2018-11-14 16:57:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-11-14 16:57:46,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:46,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:46,613 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-14 16:57:46,613 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-14 16:57:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:46,615 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2018-11-14 16:57:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-11-14 16:57:46,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:46,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:46,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:46,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 16:57:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2018-11-14 16:57:46,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 99 [2018-11-14 16:57:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:46,618 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2018-11-14 16:57:46,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 16:57:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 16:57:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 16:57:46,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:46,620 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:46,620 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:46,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -255692084, now seen corresponding path program 22 times [2018-11-14 16:57:46,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:46,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:47,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {12141#true} call ULTIMATE.init(); {12141#true} is VALID [2018-11-14 16:57:47,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {12141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12141#true} is VALID [2018-11-14 16:57:47,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {12141#true} assume true; {12141#true} is VALID [2018-11-14 16:57:47,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12141#true} {12141#true} #73#return; {12141#true} is VALID [2018-11-14 16:57:47,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {12141#true} call #t~ret7 := main(); {12141#true} is VALID [2018-11-14 16:57:47,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {12141#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12143#(= main_~i~0 0)} is VALID [2018-11-14 16:57:47,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {12143#(= main_~i~0 0)} assume true; {12143#(= main_~i~0 0)} is VALID [2018-11-14 16:57:47,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {12143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12143#(= main_~i~0 0)} is VALID [2018-11-14 16:57:47,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {12143#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12143#(= main_~i~0 0)} is VALID [2018-11-14 16:57:47,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {12143#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {12144#(<= main_~i~0 1)} assume true; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {12144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {12144#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {12144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {12145#(<= main_~i~0 2)} assume true; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {12145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {12145#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {12145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {12146#(<= main_~i~0 3)} assume true; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {12146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {12146#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {12146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {12147#(<= main_~i~0 4)} assume true; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {12147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {12147#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {12147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {12148#(<= main_~i~0 5)} assume true; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {12148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {12148#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {12148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {12149#(<= main_~i~0 6)} assume true; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {12149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {12149#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {12149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {12150#(<= main_~i~0 7)} assume true; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {12150#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {12150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {12151#(<= main_~i~0 8)} assume true; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {12151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {12151#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {12151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {12152#(<= main_~i~0 9)} assume true; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {12152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {12152#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,048 INFO L273 TraceCheckUtils]: 45: Hoare triple {12152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {12153#(<= main_~i~0 10)} assume true; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,049 INFO L273 TraceCheckUtils]: 47: Hoare triple {12153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,049 INFO L273 TraceCheckUtils]: 48: Hoare triple {12153#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {12153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,051 INFO L273 TraceCheckUtils]: 50: Hoare triple {12154#(<= main_~i~0 11)} assume true; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,051 INFO L273 TraceCheckUtils]: 51: Hoare triple {12154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,052 INFO L273 TraceCheckUtils]: 52: Hoare triple {12154#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,052 INFO L273 TraceCheckUtils]: 53: Hoare triple {12154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {12155#(<= main_~i~0 12)} assume true; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {12155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,054 INFO L273 TraceCheckUtils]: 56: Hoare triple {12155#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,055 INFO L273 TraceCheckUtils]: 57: Hoare triple {12155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,055 INFO L273 TraceCheckUtils]: 58: Hoare triple {12156#(<= main_~i~0 13)} assume true; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,056 INFO L273 TraceCheckUtils]: 59: Hoare triple {12156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {12156#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {12156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {12157#(<= main_~i~0 14)} assume true; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {12157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {12157#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,059 INFO L273 TraceCheckUtils]: 65: Hoare triple {12157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {12158#(<= main_~i~0 15)} assume true; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,060 INFO L273 TraceCheckUtils]: 67: Hoare triple {12158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {12158#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,061 INFO L273 TraceCheckUtils]: 69: Hoare triple {12158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,062 INFO L273 TraceCheckUtils]: 70: Hoare triple {12159#(<= main_~i~0 16)} assume true; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,062 INFO L273 TraceCheckUtils]: 71: Hoare triple {12159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {12159#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,064 INFO L273 TraceCheckUtils]: 73: Hoare triple {12159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {12160#(<= main_~i~0 17)} assume true; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,065 INFO L273 TraceCheckUtils]: 75: Hoare triple {12160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {12160#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {12160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {12161#(<= main_~i~0 18)} assume true; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,067 INFO L273 TraceCheckUtils]: 79: Hoare triple {12161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {12161#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {12161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,068 INFO L273 TraceCheckUtils]: 82: Hoare triple {12162#(<= main_~i~0 19)} assume true; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,069 INFO L273 TraceCheckUtils]: 83: Hoare triple {12162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,069 INFO L273 TraceCheckUtils]: 84: Hoare triple {12162#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,070 INFO L273 TraceCheckUtils]: 85: Hoare triple {12162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,071 INFO L273 TraceCheckUtils]: 86: Hoare triple {12163#(<= main_~i~0 20)} assume true; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,071 INFO L273 TraceCheckUtils]: 87: Hoare triple {12163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,072 INFO L273 TraceCheckUtils]: 88: Hoare triple {12163#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,072 INFO L273 TraceCheckUtils]: 89: Hoare triple {12163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,073 INFO L273 TraceCheckUtils]: 90: Hoare triple {12164#(<= main_~i~0 21)} assume true; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,073 INFO L273 TraceCheckUtils]: 91: Hoare triple {12164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,074 INFO L273 TraceCheckUtils]: 92: Hoare triple {12164#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,075 INFO L273 TraceCheckUtils]: 93: Hoare triple {12164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12165#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:47,075 INFO L273 TraceCheckUtils]: 94: Hoare triple {12165#(<= main_~i~0 22)} assume true; {12165#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:47,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {12165#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12142#false} is VALID [2018-11-14 16:57:47,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {12142#false} havoc ~x~0;~x~0 := 0; {12142#false} is VALID [2018-11-14 16:57:47,076 INFO L273 TraceCheckUtils]: 97: Hoare triple {12142#false} assume true; {12142#false} is VALID [2018-11-14 16:57:47,076 INFO L273 TraceCheckUtils]: 98: Hoare triple {12142#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {12142#false} is VALID [2018-11-14 16:57:47,077 INFO L256 TraceCheckUtils]: 99: Hoare triple {12142#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12142#false} is VALID [2018-11-14 16:57:47,077 INFO L273 TraceCheckUtils]: 100: Hoare triple {12142#false} ~cond := #in~cond; {12142#false} is VALID [2018-11-14 16:57:47,077 INFO L273 TraceCheckUtils]: 101: Hoare triple {12142#false} assume ~cond == 0; {12142#false} is VALID [2018-11-14 16:57:47,077 INFO L273 TraceCheckUtils]: 102: Hoare triple {12142#false} assume !false; {12142#false} is VALID [2018-11-14 16:57:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:47,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:47,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:57:47,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:57:47,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:47,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:47,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {12141#true} call ULTIMATE.init(); {12141#true} is VALID [2018-11-14 16:57:47,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {12141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12141#true} is VALID [2018-11-14 16:57:47,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {12141#true} assume true; {12141#true} is VALID [2018-11-14 16:57:47,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12141#true} {12141#true} #73#return; {12141#true} is VALID [2018-11-14 16:57:47,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {12141#true} call #t~ret7 := main(); {12141#true} is VALID [2018-11-14 16:57:47,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {12141#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12184#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:47,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {12184#(<= main_~i~0 0)} assume true; {12184#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:47,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {12184#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12184#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:47,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {12184#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12184#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:47,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {12184#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {12144#(<= main_~i~0 1)} assume true; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {12144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {12144#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12144#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:47,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {12144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {12145#(<= main_~i~0 2)} assume true; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {12145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {12145#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12145#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:47,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {12145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {12146#(<= main_~i~0 3)} assume true; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {12146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {12146#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12146#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:47,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {12146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {12147#(<= main_~i~0 4)} assume true; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {12147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {12147#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12147#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:47,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {12147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {12148#(<= main_~i~0 5)} assume true; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {12148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {12148#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12148#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:47,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {12148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {12149#(<= main_~i~0 6)} assume true; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {12149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {12149#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12149#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:47,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {12149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {12150#(<= main_~i~0 7)} assume true; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {12150#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12150#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:47,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {12150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,670 INFO L273 TraceCheckUtils]: 38: Hoare triple {12151#(<= main_~i~0 8)} assume true; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {12151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {12151#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12151#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:47,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {12151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {12152#(<= main_~i~0 9)} assume true; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {12152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {12152#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12152#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:47,674 INFO L273 TraceCheckUtils]: 45: Hoare triple {12152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {12153#(<= main_~i~0 10)} assume true; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,675 INFO L273 TraceCheckUtils]: 47: Hoare triple {12153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {12153#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12153#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:47,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {12153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,677 INFO L273 TraceCheckUtils]: 50: Hoare triple {12154#(<= main_~i~0 11)} assume true; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,677 INFO L273 TraceCheckUtils]: 51: Hoare triple {12154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {12154#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12154#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:47,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {12154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {12155#(<= main_~i~0 12)} assume true; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,679 INFO L273 TraceCheckUtils]: 55: Hoare triple {12155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {12155#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12155#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:47,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {12155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {12156#(<= main_~i~0 13)} assume true; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {12156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {12156#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12156#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:47,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {12156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {12157#(<= main_~i~0 14)} assume true; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {12157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {12157#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12157#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:47,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {12157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {12158#(<= main_~i~0 15)} assume true; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,710 INFO L273 TraceCheckUtils]: 67: Hoare triple {12158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,711 INFO L273 TraceCheckUtils]: 68: Hoare triple {12158#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12158#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:47,711 INFO L273 TraceCheckUtils]: 69: Hoare triple {12158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,712 INFO L273 TraceCheckUtils]: 70: Hoare triple {12159#(<= main_~i~0 16)} assume true; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {12159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,713 INFO L273 TraceCheckUtils]: 72: Hoare triple {12159#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12159#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:47,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {12159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,714 INFO L273 TraceCheckUtils]: 74: Hoare triple {12160#(<= main_~i~0 17)} assume true; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,714 INFO L273 TraceCheckUtils]: 75: Hoare triple {12160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,715 INFO L273 TraceCheckUtils]: 76: Hoare triple {12160#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12160#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:47,716 INFO L273 TraceCheckUtils]: 77: Hoare triple {12160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,718 INFO L273 TraceCheckUtils]: 78: Hoare triple {12161#(<= main_~i~0 18)} assume true; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {12161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {12161#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12161#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:47,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {12161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {12162#(<= main_~i~0 19)} assume true; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {12162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {12162#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12162#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:47,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {12162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {12163#(<= main_~i~0 20)} assume true; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {12163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {12163#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12163#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:47,723 INFO L273 TraceCheckUtils]: 89: Hoare triple {12163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {12164#(<= main_~i~0 21)} assume true; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,724 INFO L273 TraceCheckUtils]: 91: Hoare triple {12164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,725 INFO L273 TraceCheckUtils]: 92: Hoare triple {12164#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {12164#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:47,725 INFO L273 TraceCheckUtils]: 93: Hoare triple {12164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {12165#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:47,726 INFO L273 TraceCheckUtils]: 94: Hoare triple {12165#(<= main_~i~0 22)} assume true; {12165#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:47,726 INFO L273 TraceCheckUtils]: 95: Hoare triple {12165#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L273 TraceCheckUtils]: 96: Hoare triple {12142#false} havoc ~x~0;~x~0 := 0; {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L273 TraceCheckUtils]: 97: Hoare triple {12142#false} assume true; {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L273 TraceCheckUtils]: 98: Hoare triple {12142#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L256 TraceCheckUtils]: 99: Hoare triple {12142#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L273 TraceCheckUtils]: 100: Hoare triple {12142#false} ~cond := #in~cond; {12142#false} is VALID [2018-11-14 16:57:47,727 INFO L273 TraceCheckUtils]: 101: Hoare triple {12142#false} assume ~cond == 0; {12142#false} is VALID [2018-11-14 16:57:47,728 INFO L273 TraceCheckUtils]: 102: Hoare triple {12142#false} assume !false; {12142#false} is VALID [2018-11-14 16:57:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:47,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:47,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 16:57:47,757 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-14 16:57:47,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:47,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:57:47,866 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:57:47,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:57:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:57:47,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:57:47,868 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 26 states. [2018-11-14 16:57:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:48,440 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2018-11-14 16:57:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:57:48,440 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-14 16:57:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:57:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 168 transitions. [2018-11-14 16:57:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:57:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 168 transitions. [2018-11-14 16:57:48,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 168 transitions. [2018-11-14 16:57:48,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:48,589 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:57:48,590 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 16:57:48,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:57:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 16:57:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-14 16:57:48,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:48,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 118 states. [2018-11-14 16:57:48,635 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 118 states. [2018-11-14 16:57:48,635 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 118 states. [2018-11-14 16:57:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:48,637 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2018-11-14 16:57:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2018-11-14 16:57:48,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:48,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:48,638 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 120 states. [2018-11-14 16:57:48,638 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 120 states. [2018-11-14 16:57:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:48,640 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2018-11-14 16:57:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2018-11-14 16:57:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:48,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:48,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:48,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-14 16:57:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2018-11-14 16:57:48,643 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 103 [2018-11-14 16:57:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:48,643 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2018-11-14 16:57:48,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:57:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-14 16:57:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-14 16:57:48,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:48,644 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:48,645 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1229791261, now seen corresponding path program 23 times [2018-11-14 16:57:48,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:48,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:49,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {13042#true} call ULTIMATE.init(); {13042#true} is VALID [2018-11-14 16:57:49,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {13042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13042#true} is VALID [2018-11-14 16:57:49,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {13042#true} assume true; {13042#true} is VALID [2018-11-14 16:57:49,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13042#true} {13042#true} #73#return; {13042#true} is VALID [2018-11-14 16:57:49,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {13042#true} call #t~ret7 := main(); {13042#true} is VALID [2018-11-14 16:57:49,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {13042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13044#(= main_~i~0 0)} is VALID [2018-11-14 16:57:49,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {13044#(= main_~i~0 0)} assume true; {13044#(= main_~i~0 0)} is VALID [2018-11-14 16:57:49,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {13044#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13044#(= main_~i~0 0)} is VALID [2018-11-14 16:57:49,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {13044#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13044#(= main_~i~0 0)} is VALID [2018-11-14 16:57:49,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {13044#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:49,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {13045#(<= main_~i~0 1)} assume true; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:49,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {13045#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:49,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {13045#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:49,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {13045#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:49,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {13046#(<= main_~i~0 2)} assume true; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:49,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {13046#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:49,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {13046#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:49,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {13046#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:49,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {13047#(<= main_~i~0 3)} assume true; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:49,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {13047#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:49,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {13047#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:49,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {13047#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:49,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {13048#(<= main_~i~0 4)} assume true; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:49,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {13048#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:49,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:49,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {13048#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:49,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~0 5)} assume true; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:49,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {13049#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:49,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {13049#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:49,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {13049#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:49,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {13050#(<= main_~i~0 6)} assume true; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:49,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {13050#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:49,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {13050#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:49,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {13050#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:49,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {13051#(<= main_~i~0 7)} assume true; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:49,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {13051#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:49,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {13051#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:49,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {13051#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:49,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {13052#(<= main_~i~0 8)} assume true; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:49,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {13052#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:49,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {13052#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:49,141 INFO L273 TraceCheckUtils]: 41: Hoare triple {13052#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:49,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {13053#(<= main_~i~0 9)} assume true; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:49,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {13053#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:49,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {13053#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:49,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {13053#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:49,143 INFO L273 TraceCheckUtils]: 46: Hoare triple {13054#(<= main_~i~0 10)} assume true; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:49,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {13054#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:49,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {13054#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:49,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {13054#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:49,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {13055#(<= main_~i~0 11)} assume true; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:49,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {13055#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:49,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {13055#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:49,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {13055#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:49,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {13056#(<= main_~i~0 12)} assume true; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:49,147 INFO L273 TraceCheckUtils]: 55: Hoare triple {13056#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:49,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {13056#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:49,149 INFO L273 TraceCheckUtils]: 57: Hoare triple {13056#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:49,149 INFO L273 TraceCheckUtils]: 58: Hoare triple {13057#(<= main_~i~0 13)} assume true; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:49,150 INFO L273 TraceCheckUtils]: 59: Hoare triple {13057#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:49,150 INFO L273 TraceCheckUtils]: 60: Hoare triple {13057#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:49,151 INFO L273 TraceCheckUtils]: 61: Hoare triple {13057#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:49,152 INFO L273 TraceCheckUtils]: 62: Hoare triple {13058#(<= main_~i~0 14)} assume true; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:49,152 INFO L273 TraceCheckUtils]: 63: Hoare triple {13058#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:49,153 INFO L273 TraceCheckUtils]: 64: Hoare triple {13058#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:49,153 INFO L273 TraceCheckUtils]: 65: Hoare triple {13058#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:49,154 INFO L273 TraceCheckUtils]: 66: Hoare triple {13059#(<= main_~i~0 15)} assume true; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:49,154 INFO L273 TraceCheckUtils]: 67: Hoare triple {13059#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:49,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {13059#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:49,156 INFO L273 TraceCheckUtils]: 69: Hoare triple {13059#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:49,156 INFO L273 TraceCheckUtils]: 70: Hoare triple {13060#(<= main_~i~0 16)} assume true; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:49,157 INFO L273 TraceCheckUtils]: 71: Hoare triple {13060#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:49,157 INFO L273 TraceCheckUtils]: 72: Hoare triple {13060#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:49,158 INFO L273 TraceCheckUtils]: 73: Hoare triple {13060#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:49,158 INFO L273 TraceCheckUtils]: 74: Hoare triple {13061#(<= main_~i~0 17)} assume true; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:49,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {13061#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:49,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {13061#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:49,160 INFO L273 TraceCheckUtils]: 77: Hoare triple {13061#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:49,161 INFO L273 TraceCheckUtils]: 78: Hoare triple {13062#(<= main_~i~0 18)} assume true; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:49,161 INFO L273 TraceCheckUtils]: 79: Hoare triple {13062#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:49,162 INFO L273 TraceCheckUtils]: 80: Hoare triple {13062#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:49,162 INFO L273 TraceCheckUtils]: 81: Hoare triple {13062#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:49,163 INFO L273 TraceCheckUtils]: 82: Hoare triple {13063#(<= main_~i~0 19)} assume true; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:49,163 INFO L273 TraceCheckUtils]: 83: Hoare triple {13063#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:49,164 INFO L273 TraceCheckUtils]: 84: Hoare triple {13063#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:49,165 INFO L273 TraceCheckUtils]: 85: Hoare triple {13063#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:49,165 INFO L273 TraceCheckUtils]: 86: Hoare triple {13064#(<= main_~i~0 20)} assume true; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:49,166 INFO L273 TraceCheckUtils]: 87: Hoare triple {13064#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:49,166 INFO L273 TraceCheckUtils]: 88: Hoare triple {13064#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:49,167 INFO L273 TraceCheckUtils]: 89: Hoare triple {13064#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:49,167 INFO L273 TraceCheckUtils]: 90: Hoare triple {13065#(<= main_~i~0 21)} assume true; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:49,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {13065#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:49,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {13065#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:49,169 INFO L273 TraceCheckUtils]: 93: Hoare triple {13065#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:49,170 INFO L273 TraceCheckUtils]: 94: Hoare triple {13066#(<= main_~i~0 22)} assume true; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:49,170 INFO L273 TraceCheckUtils]: 95: Hoare triple {13066#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:49,171 INFO L273 TraceCheckUtils]: 96: Hoare triple {13066#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:49,171 INFO L273 TraceCheckUtils]: 97: Hoare triple {13066#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13067#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:49,172 INFO L273 TraceCheckUtils]: 98: Hoare triple {13067#(<= main_~i~0 23)} assume true; {13067#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:49,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {13067#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13043#false} is VALID [2018-11-14 16:57:49,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {13043#false} havoc ~x~0;~x~0 := 0; {13043#false} is VALID [2018-11-14 16:57:49,173 INFO L273 TraceCheckUtils]: 101: Hoare triple {13043#false} assume true; {13043#false} is VALID [2018-11-14 16:57:49,173 INFO L273 TraceCheckUtils]: 102: Hoare triple {13043#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {13043#false} is VALID [2018-11-14 16:57:49,173 INFO L256 TraceCheckUtils]: 103: Hoare triple {13043#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13043#false} is VALID [2018-11-14 16:57:49,174 INFO L273 TraceCheckUtils]: 104: Hoare triple {13043#false} ~cond := #in~cond; {13043#false} is VALID [2018-11-14 16:57:49,174 INFO L273 TraceCheckUtils]: 105: Hoare triple {13043#false} assume ~cond == 0; {13043#false} is VALID [2018-11-14 16:57:49,174 INFO L273 TraceCheckUtils]: 106: Hoare triple {13043#false} assume !false; {13043#false} is VALID [2018-11-14 16:57:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:49,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:49,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:49,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:57:50,737 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 16:57:50,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:50,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:51,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {13042#true} call ULTIMATE.init(); {13042#true} is VALID [2018-11-14 16:57:51,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {13042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13042#true} is VALID [2018-11-14 16:57:51,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {13042#true} assume true; {13042#true} is VALID [2018-11-14 16:57:51,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13042#true} {13042#true} #73#return; {13042#true} is VALID [2018-11-14 16:57:51,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {13042#true} call #t~ret7 := main(); {13042#true} is VALID [2018-11-14 16:57:51,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {13042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13086#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:51,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(<= main_~i~0 0)} assume true; {13086#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:51,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13086#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:51,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13086#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:51,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {13086#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:51,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {13045#(<= main_~i~0 1)} assume true; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:51,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {13045#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:51,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {13045#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13045#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:51,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {13045#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:51,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {13046#(<= main_~i~0 2)} assume true; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:51,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {13046#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:51,041 INFO L273 TraceCheckUtils]: 16: Hoare triple {13046#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13046#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:51,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {13046#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:51,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {13047#(<= main_~i~0 3)} assume true; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:51,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {13047#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:51,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {13047#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13047#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:51,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {13047#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:51,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {13048#(<= main_~i~0 4)} assume true; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:51,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {13048#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:51,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13048#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:51,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {13048#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:51,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~0 5)} assume true; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:51,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {13049#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:51,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {13049#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13049#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:51,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {13049#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:51,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {13050#(<= main_~i~0 6)} assume true; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:51,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {13050#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:51,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {13050#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13050#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:51,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {13050#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:51,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {13051#(<= main_~i~0 7)} assume true; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:51,059 INFO L273 TraceCheckUtils]: 35: Hoare triple {13051#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:51,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {13051#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13051#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:51,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {13051#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:51,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {13052#(<= main_~i~0 8)} assume true; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:51,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {13052#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:51,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {13052#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13052#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:51,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {13052#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:51,068 INFO L273 TraceCheckUtils]: 42: Hoare triple {13053#(<= main_~i~0 9)} assume true; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:51,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {13053#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:51,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {13053#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13053#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:51,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {13053#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:51,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {13054#(<= main_~i~0 10)} assume true; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:51,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {13054#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:51,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {13054#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13054#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:51,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {13054#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:51,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {13055#(<= main_~i~0 11)} assume true; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:51,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {13055#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:51,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {13055#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13055#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:51,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {13055#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:51,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {13056#(<= main_~i~0 12)} assume true; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:51,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {13056#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:51,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {13056#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13056#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:51,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {13056#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:51,082 INFO L273 TraceCheckUtils]: 58: Hoare triple {13057#(<= main_~i~0 13)} assume true; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:51,084 INFO L273 TraceCheckUtils]: 59: Hoare triple {13057#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:51,084 INFO L273 TraceCheckUtils]: 60: Hoare triple {13057#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13057#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:51,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {13057#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:51,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {13058#(<= main_~i~0 14)} assume true; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:51,088 INFO L273 TraceCheckUtils]: 63: Hoare triple {13058#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:51,088 INFO L273 TraceCheckUtils]: 64: Hoare triple {13058#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13058#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:51,090 INFO L273 TraceCheckUtils]: 65: Hoare triple {13058#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:51,090 INFO L273 TraceCheckUtils]: 66: Hoare triple {13059#(<= main_~i~0 15)} assume true; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:51,092 INFO L273 TraceCheckUtils]: 67: Hoare triple {13059#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:51,092 INFO L273 TraceCheckUtils]: 68: Hoare triple {13059#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13059#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:51,094 INFO L273 TraceCheckUtils]: 69: Hoare triple {13059#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:51,094 INFO L273 TraceCheckUtils]: 70: Hoare triple {13060#(<= main_~i~0 16)} assume true; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:51,096 INFO L273 TraceCheckUtils]: 71: Hoare triple {13060#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:51,096 INFO L273 TraceCheckUtils]: 72: Hoare triple {13060#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13060#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:51,098 INFO L273 TraceCheckUtils]: 73: Hoare triple {13060#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:51,098 INFO L273 TraceCheckUtils]: 74: Hoare triple {13061#(<= main_~i~0 17)} assume true; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:51,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {13061#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:51,101 INFO L273 TraceCheckUtils]: 76: Hoare triple {13061#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13061#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:51,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {13061#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:51,103 INFO L273 TraceCheckUtils]: 78: Hoare triple {13062#(<= main_~i~0 18)} assume true; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:51,105 INFO L273 TraceCheckUtils]: 79: Hoare triple {13062#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:51,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {13062#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13062#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:51,108 INFO L273 TraceCheckUtils]: 81: Hoare triple {13062#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:51,108 INFO L273 TraceCheckUtils]: 82: Hoare triple {13063#(<= main_~i~0 19)} assume true; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:51,110 INFO L273 TraceCheckUtils]: 83: Hoare triple {13063#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:51,110 INFO L273 TraceCheckUtils]: 84: Hoare triple {13063#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13063#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:51,112 INFO L273 TraceCheckUtils]: 85: Hoare triple {13063#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:51,112 INFO L273 TraceCheckUtils]: 86: Hoare triple {13064#(<= main_~i~0 20)} assume true; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:51,114 INFO L273 TraceCheckUtils]: 87: Hoare triple {13064#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:51,114 INFO L273 TraceCheckUtils]: 88: Hoare triple {13064#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13064#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:51,116 INFO L273 TraceCheckUtils]: 89: Hoare triple {13064#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:51,116 INFO L273 TraceCheckUtils]: 90: Hoare triple {13065#(<= main_~i~0 21)} assume true; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:51,119 INFO L273 TraceCheckUtils]: 91: Hoare triple {13065#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:51,119 INFO L273 TraceCheckUtils]: 92: Hoare triple {13065#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13065#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:51,121 INFO L273 TraceCheckUtils]: 93: Hoare triple {13065#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:51,121 INFO L273 TraceCheckUtils]: 94: Hoare triple {13066#(<= main_~i~0 22)} assume true; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:51,123 INFO L273 TraceCheckUtils]: 95: Hoare triple {13066#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:51,123 INFO L273 TraceCheckUtils]: 96: Hoare triple {13066#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13066#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:51,125 INFO L273 TraceCheckUtils]: 97: Hoare triple {13066#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13067#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:51,125 INFO L273 TraceCheckUtils]: 98: Hoare triple {13067#(<= main_~i~0 23)} assume true; {13067#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 99: Hoare triple {13067#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 100: Hoare triple {13043#false} havoc ~x~0;~x~0 := 0; {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 101: Hoare triple {13043#false} assume true; {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 102: Hoare triple {13043#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L256 TraceCheckUtils]: 103: Hoare triple {13043#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 104: Hoare triple {13043#false} ~cond := #in~cond; {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 105: Hoare triple {13043#false} assume ~cond == 0; {13043#false} is VALID [2018-11-14 16:57:51,128 INFO L273 TraceCheckUtils]: 106: Hoare triple {13043#false} assume !false; {13043#false} is VALID [2018-11-14 16:57:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:51,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:51,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 16:57:51,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-14 16:57:51,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:51,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 16:57:51,762 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:57:51,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 16:57:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 16:57:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:57:51,763 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 27 states. [2018-11-14 16:57:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:52,464 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-11-14 16:57:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 16:57:52,464 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-14 16:57:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:57:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2018-11-14 16:57:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:57:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2018-11-14 16:57:52,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2018-11-14 16:57:52,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:52,639 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:57:52,639 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 16:57:52,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:57:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 16:57:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-14 16:57:52,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:52,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-14 16:57:52,672 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-14 16:57:52,672 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-14 16:57:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:52,673 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-11-14 16:57:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-14 16:57:52,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:52,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:52,674 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-14 16:57:52,674 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-14 16:57:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:52,677 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-11-14 16:57:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-14 16:57:52,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:52,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:52,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:52,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:57:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2018-11-14 16:57:52,679 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 107 [2018-11-14 16:57:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:52,680 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2018-11-14 16:57:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 16:57:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-14 16:57:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-14 16:57:52,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:52,681 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:52,681 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:52,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 99150202, now seen corresponding path program 24 times [2018-11-14 16:57:52,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:52,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:52,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:53,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2018-11-14 16:57:53,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {13974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13974#true} is VALID [2018-11-14 16:57:53,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2018-11-14 16:57:53,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #73#return; {13974#true} is VALID [2018-11-14 16:57:53,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret7 := main(); {13974#true} is VALID [2018-11-14 16:57:53,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {13974#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13976#(= main_~i~0 0)} is VALID [2018-11-14 16:57:53,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {13976#(= main_~i~0 0)} assume true; {13976#(= main_~i~0 0)} is VALID [2018-11-14 16:57:53,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {13976#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13976#(= main_~i~0 0)} is VALID [2018-11-14 16:57:53,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {13976#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13976#(= main_~i~0 0)} is VALID [2018-11-14 16:57:53,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {13976#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:53,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {13977#(<= main_~i~0 1)} assume true; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:53,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {13977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:53,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:53,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:53,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 2)} assume true; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:53,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:53,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:53,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:53,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 3)} assume true; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:53,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:53,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:53,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:53,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 4)} assume true; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:53,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:53,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {13980#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:53,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {13980#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:53,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {13981#(<= main_~i~0 5)} assume true; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:53,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {13981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:53,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {13981#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:53,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {13981#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:53,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {13982#(<= main_~i~0 6)} assume true; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:53,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {13982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:53,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {13982#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:53,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {13982#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:53,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {13983#(<= main_~i~0 7)} assume true; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:53,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {13983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:53,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {13983#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:53,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {13983#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:53,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {13984#(<= main_~i~0 8)} assume true; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:53,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {13984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:53,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {13984#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:53,757 INFO L273 TraceCheckUtils]: 41: Hoare triple {13984#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:53,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {13985#(<= main_~i~0 9)} assume true; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:53,758 INFO L273 TraceCheckUtils]: 43: Hoare triple {13985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:53,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {13985#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:53,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {13985#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:53,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {13986#(<= main_~i~0 10)} assume true; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:53,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {13986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:53,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {13986#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:53,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {13986#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:53,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {13987#(<= main_~i~0 11)} assume true; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:53,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {13987#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:53,763 INFO L273 TraceCheckUtils]: 52: Hoare triple {13987#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:53,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {13987#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:53,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {13988#(<= main_~i~0 12)} assume true; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:53,765 INFO L273 TraceCheckUtils]: 55: Hoare triple {13988#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:53,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {13988#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:53,766 INFO L273 TraceCheckUtils]: 57: Hoare triple {13988#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:53,767 INFO L273 TraceCheckUtils]: 58: Hoare triple {13989#(<= main_~i~0 13)} assume true; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:53,767 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:53,768 INFO L273 TraceCheckUtils]: 60: Hoare triple {13989#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:53,768 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:53,769 INFO L273 TraceCheckUtils]: 62: Hoare triple {13990#(<= main_~i~0 14)} assume true; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:53,769 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:53,770 INFO L273 TraceCheckUtils]: 64: Hoare triple {13990#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:53,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:53,771 INFO L273 TraceCheckUtils]: 66: Hoare triple {13991#(<= main_~i~0 15)} assume true; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:53,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {13991#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:53,772 INFO L273 TraceCheckUtils]: 68: Hoare triple {13991#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:53,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {13991#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:53,773 INFO L273 TraceCheckUtils]: 70: Hoare triple {13992#(<= main_~i~0 16)} assume true; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:53,774 INFO L273 TraceCheckUtils]: 71: Hoare triple {13992#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:53,774 INFO L273 TraceCheckUtils]: 72: Hoare triple {13992#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:53,775 INFO L273 TraceCheckUtils]: 73: Hoare triple {13992#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:53,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {13993#(<= main_~i~0 17)} assume true; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:53,776 INFO L273 TraceCheckUtils]: 75: Hoare triple {13993#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:53,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {13993#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:53,777 INFO L273 TraceCheckUtils]: 77: Hoare triple {13993#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:53,778 INFO L273 TraceCheckUtils]: 78: Hoare triple {13994#(<= main_~i~0 18)} assume true; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:53,779 INFO L273 TraceCheckUtils]: 79: Hoare triple {13994#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:53,779 INFO L273 TraceCheckUtils]: 80: Hoare triple {13994#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:53,780 INFO L273 TraceCheckUtils]: 81: Hoare triple {13994#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:53,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {13995#(<= main_~i~0 19)} assume true; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:53,781 INFO L273 TraceCheckUtils]: 83: Hoare triple {13995#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:53,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {13995#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:53,782 INFO L273 TraceCheckUtils]: 85: Hoare triple {13995#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:53,783 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#(<= main_~i~0 20)} assume true; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:53,783 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:53,784 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:53,784 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:53,785 INFO L273 TraceCheckUtils]: 90: Hoare triple {13997#(<= main_~i~0 21)} assume true; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:53,785 INFO L273 TraceCheckUtils]: 91: Hoare triple {13997#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:53,786 INFO L273 TraceCheckUtils]: 92: Hoare triple {13997#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:53,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {13997#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:53,787 INFO L273 TraceCheckUtils]: 94: Hoare triple {13998#(<= main_~i~0 22)} assume true; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:53,788 INFO L273 TraceCheckUtils]: 95: Hoare triple {13998#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:53,788 INFO L273 TraceCheckUtils]: 96: Hoare triple {13998#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:53,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {13998#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:53,789 INFO L273 TraceCheckUtils]: 98: Hoare triple {13999#(<= main_~i~0 23)} assume true; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:53,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {13999#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:53,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {13999#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:53,791 INFO L273 TraceCheckUtils]: 101: Hoare triple {13999#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14000#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:53,792 INFO L273 TraceCheckUtils]: 102: Hoare triple {14000#(<= main_~i~0 24)} assume true; {14000#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:53,792 INFO L273 TraceCheckUtils]: 103: Hoare triple {14000#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13975#false} is VALID [2018-11-14 16:57:53,793 INFO L273 TraceCheckUtils]: 104: Hoare triple {13975#false} havoc ~x~0;~x~0 := 0; {13975#false} is VALID [2018-11-14 16:57:53,793 INFO L273 TraceCheckUtils]: 105: Hoare triple {13975#false} assume true; {13975#false} is VALID [2018-11-14 16:57:53,793 INFO L273 TraceCheckUtils]: 106: Hoare triple {13975#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {13975#false} is VALID [2018-11-14 16:57:53,793 INFO L256 TraceCheckUtils]: 107: Hoare triple {13975#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13975#false} is VALID [2018-11-14 16:57:53,794 INFO L273 TraceCheckUtils]: 108: Hoare triple {13975#false} ~cond := #in~cond; {13975#false} is VALID [2018-11-14 16:57:53,794 INFO L273 TraceCheckUtils]: 109: Hoare triple {13975#false} assume ~cond == 0; {13975#false} is VALID [2018-11-14 16:57:53,794 INFO L273 TraceCheckUtils]: 110: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2018-11-14 16:57:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:53,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:53,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:57:54,574 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 16:57:54,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:54,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:54,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2018-11-14 16:57:54,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {13974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13974#true} is VALID [2018-11-14 16:57:54,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2018-11-14 16:57:54,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #73#return; {13974#true} is VALID [2018-11-14 16:57:54,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret7 := main(); {13974#true} is VALID [2018-11-14 16:57:54,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {13974#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14019#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:54,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {14019#(<= main_~i~0 0)} assume true; {14019#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:54,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {14019#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14019#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:54,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {14019#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14019#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:54,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:54,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {13977#(<= main_~i~0 1)} assume true; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:54,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {13977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:54,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13977#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:54,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:54,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 2)} assume true; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:54,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:54,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13978#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:54,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:54,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 3)} assume true; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:54,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:54,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13979#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:54,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:54,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 4)} assume true; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:54,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:54,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {13980#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13980#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:54,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {13980#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:54,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {13981#(<= main_~i~0 5)} assume true; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:54,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {13981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:54,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {13981#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13981#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:54,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {13981#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:54,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {13982#(<= main_~i~0 6)} assume true; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:54,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {13982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:54,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {13982#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13982#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:54,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {13982#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:54,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {13983#(<= main_~i~0 7)} assume true; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:54,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {13983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:54,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {13983#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13983#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:54,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {13983#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:54,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {13984#(<= main_~i~0 8)} assume true; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:54,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {13984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:54,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {13984#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13984#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:54,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {13984#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:54,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {13985#(<= main_~i~0 9)} assume true; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:54,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {13985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:54,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {13985#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13985#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:54,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {13985#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:54,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {13986#(<= main_~i~0 10)} assume true; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:54,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {13986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:54,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {13986#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13986#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:54,829 INFO L273 TraceCheckUtils]: 49: Hoare triple {13986#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:54,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {13987#(<= main_~i~0 11)} assume true; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:54,830 INFO L273 TraceCheckUtils]: 51: Hoare triple {13987#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:54,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {13987#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13987#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:54,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {13987#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:54,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {13988#(<= main_~i~0 12)} assume true; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:54,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {13988#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:54,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {13988#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13988#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:54,834 INFO L273 TraceCheckUtils]: 57: Hoare triple {13988#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:54,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {13989#(<= main_~i~0 13)} assume true; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:54,835 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:54,835 INFO L273 TraceCheckUtils]: 60: Hoare triple {13989#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13989#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:54,836 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:54,836 INFO L273 TraceCheckUtils]: 62: Hoare triple {13990#(<= main_~i~0 14)} assume true; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:54,837 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:54,837 INFO L273 TraceCheckUtils]: 64: Hoare triple {13990#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13990#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:54,838 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:54,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {13991#(<= main_~i~0 15)} assume true; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:54,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {13991#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:54,840 INFO L273 TraceCheckUtils]: 68: Hoare triple {13991#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13991#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:54,840 INFO L273 TraceCheckUtils]: 69: Hoare triple {13991#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:54,841 INFO L273 TraceCheckUtils]: 70: Hoare triple {13992#(<= main_~i~0 16)} assume true; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:54,841 INFO L273 TraceCheckUtils]: 71: Hoare triple {13992#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:54,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {13992#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13992#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:54,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {13992#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:54,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {13993#(<= main_~i~0 17)} assume true; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:54,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {13993#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:54,844 INFO L273 TraceCheckUtils]: 76: Hoare triple {13993#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13993#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:54,845 INFO L273 TraceCheckUtils]: 77: Hoare triple {13993#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:54,845 INFO L273 TraceCheckUtils]: 78: Hoare triple {13994#(<= main_~i~0 18)} assume true; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:54,846 INFO L273 TraceCheckUtils]: 79: Hoare triple {13994#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:54,846 INFO L273 TraceCheckUtils]: 80: Hoare triple {13994#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13994#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:54,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {13994#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:54,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {13995#(<= main_~i~0 19)} assume true; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:54,848 INFO L273 TraceCheckUtils]: 83: Hoare triple {13995#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:54,848 INFO L273 TraceCheckUtils]: 84: Hoare triple {13995#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13995#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:54,849 INFO L273 TraceCheckUtils]: 85: Hoare triple {13995#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:54,850 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#(<= main_~i~0 20)} assume true; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:54,850 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:54,851 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13996#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:54,851 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:54,852 INFO L273 TraceCheckUtils]: 90: Hoare triple {13997#(<= main_~i~0 21)} assume true; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:54,852 INFO L273 TraceCheckUtils]: 91: Hoare triple {13997#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:54,853 INFO L273 TraceCheckUtils]: 92: Hoare triple {13997#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13997#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:54,853 INFO L273 TraceCheckUtils]: 93: Hoare triple {13997#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:54,854 INFO L273 TraceCheckUtils]: 94: Hoare triple {13998#(<= main_~i~0 22)} assume true; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:54,854 INFO L273 TraceCheckUtils]: 95: Hoare triple {13998#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:54,855 INFO L273 TraceCheckUtils]: 96: Hoare triple {13998#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13998#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:54,855 INFO L273 TraceCheckUtils]: 97: Hoare triple {13998#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:54,856 INFO L273 TraceCheckUtils]: 98: Hoare triple {13999#(<= main_~i~0 23)} assume true; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:54,856 INFO L273 TraceCheckUtils]: 99: Hoare triple {13999#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:54,857 INFO L273 TraceCheckUtils]: 100: Hoare triple {13999#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {13999#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:54,858 INFO L273 TraceCheckUtils]: 101: Hoare triple {13999#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14000#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:54,858 INFO L273 TraceCheckUtils]: 102: Hoare triple {14000#(<= main_~i~0 24)} assume true; {14000#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:54,859 INFO L273 TraceCheckUtils]: 103: Hoare triple {14000#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13975#false} is VALID [2018-11-14 16:57:54,859 INFO L273 TraceCheckUtils]: 104: Hoare triple {13975#false} havoc ~x~0;~x~0 := 0; {13975#false} is VALID [2018-11-14 16:57:54,859 INFO L273 TraceCheckUtils]: 105: Hoare triple {13975#false} assume true; {13975#false} is VALID [2018-11-14 16:57:54,859 INFO L273 TraceCheckUtils]: 106: Hoare triple {13975#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {13975#false} is VALID [2018-11-14 16:57:54,860 INFO L256 TraceCheckUtils]: 107: Hoare triple {13975#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13975#false} is VALID [2018-11-14 16:57:54,860 INFO L273 TraceCheckUtils]: 108: Hoare triple {13975#false} ~cond := #in~cond; {13975#false} is VALID [2018-11-14 16:57:54,860 INFO L273 TraceCheckUtils]: 109: Hoare triple {13975#false} assume ~cond == 0; {13975#false} is VALID [2018-11-14 16:57:54,860 INFO L273 TraceCheckUtils]: 110: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2018-11-14 16:57:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:54,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:54,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 16:57:54,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-14 16:57:54,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:54,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 16:57:55,412 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:57:55,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 16:57:55,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 16:57:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:57:55,414 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 28 states. [2018-11-14 16:57:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:56,290 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2018-11-14 16:57:56,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 16:57:56,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-14 16:57:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:57:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 178 transitions. [2018-11-14 16:57:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:57:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 178 transitions. [2018-11-14 16:57:56,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 178 transitions. [2018-11-14 16:57:56,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:56,539 INFO L225 Difference]: With dead ends: 146 [2018-11-14 16:57:56,539 INFO L226 Difference]: Without dead ends: 128 [2018-11-14 16:57:56,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 16:57:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-14 16:57:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-14 16:57:56,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:56,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-14 16:57:56,564 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-14 16:57:56,565 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-14 16:57:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:56,567 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-11-14 16:57:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2018-11-14 16:57:56,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:56,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:56,568 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-14 16:57:56,568 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-14 16:57:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:56,570 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-11-14 16:57:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2018-11-14 16:57:56,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:56,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:56,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:56,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-14 16:57:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2018-11-14 16:57:56,573 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 111 [2018-11-14 16:57:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:56,573 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2018-11-14 16:57:56,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 16:57:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-14 16:57:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-14 16:57:56,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:56,574 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:56,575 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:56,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1363300241, now seen corresponding path program 25 times [2018-11-14 16:57:56,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:56,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:56,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:57:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:57,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {14937#true} call ULTIMATE.init(); {14937#true} is VALID [2018-11-14 16:57:57,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {14937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14937#true} is VALID [2018-11-14 16:57:57,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {14937#true} assume true; {14937#true} is VALID [2018-11-14 16:57:57,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14937#true} {14937#true} #73#return; {14937#true} is VALID [2018-11-14 16:57:57,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {14937#true} call #t~ret7 := main(); {14937#true} is VALID [2018-11-14 16:57:57,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {14937#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14939#(= main_~i~0 0)} is VALID [2018-11-14 16:57:57,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {14939#(= main_~i~0 0)} assume true; {14939#(= main_~i~0 0)} is VALID [2018-11-14 16:57:57,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {14939#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14939#(= main_~i~0 0)} is VALID [2018-11-14 16:57:57,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {14939#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14939#(= main_~i~0 0)} is VALID [2018-11-14 16:57:57,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {14939#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {14940#(<= main_~i~0 1)} assume true; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {14940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {14940#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {14940#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {14941#(<= main_~i~0 2)} assume true; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {14941#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {14941#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {14941#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:57,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {14942#(<= main_~i~0 3)} assume true; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:57,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {14942#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:57,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {14942#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:57,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {14942#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:57,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {14943#(<= main_~i~0 4)} assume true; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:57,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {14943#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:57,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:57,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:57,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 5)} assume true; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:57,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:57,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {14944#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:57,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {14944#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:57,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {14945#(<= main_~i~0 6)} assume true; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:57,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {14945#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:57,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {14945#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:57,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {14945#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:57,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {14946#(<= main_~i~0 7)} assume true; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:57,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {14946#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:57,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {14946#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:57,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {14946#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:57,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {14947#(<= main_~i~0 8)} assume true; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:57,495 INFO L273 TraceCheckUtils]: 39: Hoare triple {14947#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:57,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {14947#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:57,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {14947#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:57,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {14948#(<= main_~i~0 9)} assume true; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:57,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {14948#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:57,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {14948#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:57,502 INFO L273 TraceCheckUtils]: 45: Hoare triple {14948#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:57,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {14949#(<= main_~i~0 10)} assume true; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:57,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {14949#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:57,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {14949#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:57,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {14949#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:57,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {14950#(<= main_~i~0 11)} assume true; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:57,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {14950#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:57,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {14950#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:57,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {14950#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:57,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {14951#(<= main_~i~0 12)} assume true; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:57,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {14951#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:57,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {14951#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:57,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {14951#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:57,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {14952#(<= main_~i~0 13)} assume true; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:57,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {14952#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:57,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {14952#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:57,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {14952#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:57,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {14953#(<= main_~i~0 14)} assume true; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:57,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {14953#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:57,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {14953#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:57,512 INFO L273 TraceCheckUtils]: 65: Hoare triple {14953#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:57,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {14954#(<= main_~i~0 15)} assume true; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:57,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {14954#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:57,513 INFO L273 TraceCheckUtils]: 68: Hoare triple {14954#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:57,514 INFO L273 TraceCheckUtils]: 69: Hoare triple {14954#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:57,514 INFO L273 TraceCheckUtils]: 70: Hoare triple {14955#(<= main_~i~0 16)} assume true; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:57,515 INFO L273 TraceCheckUtils]: 71: Hoare triple {14955#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:57,515 INFO L273 TraceCheckUtils]: 72: Hoare triple {14955#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:57,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {14955#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:57,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {14956#(<= main_~i~0 17)} assume true; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:57,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {14956#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:57,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {14956#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:57,518 INFO L273 TraceCheckUtils]: 77: Hoare triple {14956#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:57,519 INFO L273 TraceCheckUtils]: 78: Hoare triple {14957#(<= main_~i~0 18)} assume true; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:57,519 INFO L273 TraceCheckUtils]: 79: Hoare triple {14957#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:57,519 INFO L273 TraceCheckUtils]: 80: Hoare triple {14957#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:57,520 INFO L273 TraceCheckUtils]: 81: Hoare triple {14957#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:57,521 INFO L273 TraceCheckUtils]: 82: Hoare triple {14958#(<= main_~i~0 19)} assume true; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:57,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {14958#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:57,522 INFO L273 TraceCheckUtils]: 84: Hoare triple {14958#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:57,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {14958#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:57,523 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#(<= main_~i~0 20)} assume true; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:57,523 INFO L273 TraceCheckUtils]: 87: Hoare triple {14959#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:57,524 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:57,524 INFO L273 TraceCheckUtils]: 89: Hoare triple {14959#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:57,525 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#(<= main_~i~0 21)} assume true; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:57,526 INFO L273 TraceCheckUtils]: 91: Hoare triple {14960#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:57,527 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:57,528 INFO L273 TraceCheckUtils]: 93: Hoare triple {14960#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:57,528 INFO L273 TraceCheckUtils]: 94: Hoare triple {14961#(<= main_~i~0 22)} assume true; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:57,529 INFO L273 TraceCheckUtils]: 95: Hoare triple {14961#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:57,529 INFO L273 TraceCheckUtils]: 96: Hoare triple {14961#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:57,530 INFO L273 TraceCheckUtils]: 97: Hoare triple {14961#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:57,530 INFO L273 TraceCheckUtils]: 98: Hoare triple {14962#(<= main_~i~0 23)} assume true; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:57,531 INFO L273 TraceCheckUtils]: 99: Hoare triple {14962#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:57,531 INFO L273 TraceCheckUtils]: 100: Hoare triple {14962#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:57,532 INFO L273 TraceCheckUtils]: 101: Hoare triple {14962#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:57,532 INFO L273 TraceCheckUtils]: 102: Hoare triple {14963#(<= main_~i~0 24)} assume true; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:57,533 INFO L273 TraceCheckUtils]: 103: Hoare triple {14963#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:57,533 INFO L273 TraceCheckUtils]: 104: Hoare triple {14963#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:57,534 INFO L273 TraceCheckUtils]: 105: Hoare triple {14963#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14964#(<= main_~i~0 25)} is VALID [2018-11-14 16:57:57,535 INFO L273 TraceCheckUtils]: 106: Hoare triple {14964#(<= main_~i~0 25)} assume true; {14964#(<= main_~i~0 25)} is VALID [2018-11-14 16:57:57,535 INFO L273 TraceCheckUtils]: 107: Hoare triple {14964#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14938#false} is VALID [2018-11-14 16:57:57,535 INFO L273 TraceCheckUtils]: 108: Hoare triple {14938#false} havoc ~x~0;~x~0 := 0; {14938#false} is VALID [2018-11-14 16:57:57,536 INFO L273 TraceCheckUtils]: 109: Hoare triple {14938#false} assume true; {14938#false} is VALID [2018-11-14 16:57:57,536 INFO L273 TraceCheckUtils]: 110: Hoare triple {14938#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {14938#false} is VALID [2018-11-14 16:57:57,536 INFO L256 TraceCheckUtils]: 111: Hoare triple {14938#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14938#false} is VALID [2018-11-14 16:57:57,536 INFO L273 TraceCheckUtils]: 112: Hoare triple {14938#false} ~cond := #in~cond; {14938#false} is VALID [2018-11-14 16:57:57,536 INFO L273 TraceCheckUtils]: 113: Hoare triple {14938#false} assume ~cond == 0; {14938#false} is VALID [2018-11-14 16:57:57,537 INFO L273 TraceCheckUtils]: 114: Hoare triple {14938#false} assume !false; {14938#false} is VALID [2018-11-14 16:57:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:57,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:57:57,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:57:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:57,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:57,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {14937#true} call ULTIMATE.init(); {14937#true} is VALID [2018-11-14 16:57:57,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {14937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14937#true} is VALID [2018-11-14 16:57:57,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {14937#true} assume true; {14937#true} is VALID [2018-11-14 16:57:57,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14937#true} {14937#true} #73#return; {14937#true} is VALID [2018-11-14 16:57:57,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {14937#true} call #t~ret7 := main(); {14937#true} is VALID [2018-11-14 16:57:57,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {14937#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14983#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:57,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {14983#(<= main_~i~0 0)} assume true; {14983#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:57,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {14983#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14983#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:57,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {14983#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14983#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:57,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {14983#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {14940#(<= main_~i~0 1)} assume true; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {14940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {14940#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14940#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:57,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {14940#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {14941#(<= main_~i~0 2)} assume true; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {14941#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {14941#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14941#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:57,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {14941#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:58,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {14942#(<= main_~i~0 3)} assume true; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:58,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {14942#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:58,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {14942#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14942#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:58,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {14942#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:58,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {14943#(<= main_~i~0 4)} assume true; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:58,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {14943#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:58,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14943#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:58,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:58,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 5)} assume true; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:58,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:58,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {14944#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14944#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:58,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {14944#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:58,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {14945#(<= main_~i~0 6)} assume true; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:58,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {14945#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:58,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {14945#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14945#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:58,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {14945#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:58,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {14946#(<= main_~i~0 7)} assume true; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:58,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {14946#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:58,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {14946#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14946#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:58,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {14946#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:58,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {14947#(<= main_~i~0 8)} assume true; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:58,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {14947#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:58,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {14947#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14947#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:58,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {14947#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:58,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {14948#(<= main_~i~0 9)} assume true; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:58,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {14948#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:58,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {14948#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14948#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:58,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {14948#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:58,147 INFO L273 TraceCheckUtils]: 46: Hoare triple {14949#(<= main_~i~0 10)} assume true; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:58,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {14949#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:58,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {14949#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14949#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:58,148 INFO L273 TraceCheckUtils]: 49: Hoare triple {14949#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:58,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {14950#(<= main_~i~0 11)} assume true; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:58,148 INFO L273 TraceCheckUtils]: 51: Hoare triple {14950#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:58,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {14950#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14950#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:58,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {14950#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:58,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {14951#(<= main_~i~0 12)} assume true; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:58,150 INFO L273 TraceCheckUtils]: 55: Hoare triple {14951#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:58,151 INFO L273 TraceCheckUtils]: 56: Hoare triple {14951#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14951#(<= main_~i~0 12)} is VALID [2018-11-14 16:57:58,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {14951#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:58,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {14952#(<= main_~i~0 13)} assume true; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:58,182 INFO L273 TraceCheckUtils]: 59: Hoare triple {14952#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:58,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {14952#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14952#(<= main_~i~0 13)} is VALID [2018-11-14 16:57:58,183 INFO L273 TraceCheckUtils]: 61: Hoare triple {14952#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:58,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {14953#(<= main_~i~0 14)} assume true; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:58,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {14953#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:58,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {14953#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14953#(<= main_~i~0 14)} is VALID [2018-11-14 16:57:58,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {14953#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:58,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {14954#(<= main_~i~0 15)} assume true; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:58,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {14954#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:58,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {14954#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14954#(<= main_~i~0 15)} is VALID [2018-11-14 16:57:58,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {14954#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:58,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {14955#(<= main_~i~0 16)} assume true; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:58,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {14955#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:58,190 INFO L273 TraceCheckUtils]: 72: Hoare triple {14955#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14955#(<= main_~i~0 16)} is VALID [2018-11-14 16:57:58,190 INFO L273 TraceCheckUtils]: 73: Hoare triple {14955#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:58,190 INFO L273 TraceCheckUtils]: 74: Hoare triple {14956#(<= main_~i~0 17)} assume true; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:58,191 INFO L273 TraceCheckUtils]: 75: Hoare triple {14956#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:58,191 INFO L273 TraceCheckUtils]: 76: Hoare triple {14956#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14956#(<= main_~i~0 17)} is VALID [2018-11-14 16:57:58,191 INFO L273 TraceCheckUtils]: 77: Hoare triple {14956#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:58,192 INFO L273 TraceCheckUtils]: 78: Hoare triple {14957#(<= main_~i~0 18)} assume true; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:58,192 INFO L273 TraceCheckUtils]: 79: Hoare triple {14957#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:58,193 INFO L273 TraceCheckUtils]: 80: Hoare triple {14957#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14957#(<= main_~i~0 18)} is VALID [2018-11-14 16:57:58,194 INFO L273 TraceCheckUtils]: 81: Hoare triple {14957#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:58,194 INFO L273 TraceCheckUtils]: 82: Hoare triple {14958#(<= main_~i~0 19)} assume true; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:58,194 INFO L273 TraceCheckUtils]: 83: Hoare triple {14958#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:58,195 INFO L273 TraceCheckUtils]: 84: Hoare triple {14958#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14958#(<= main_~i~0 19)} is VALID [2018-11-14 16:57:58,196 INFO L273 TraceCheckUtils]: 85: Hoare triple {14958#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:58,196 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#(<= main_~i~0 20)} assume true; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:58,197 INFO L273 TraceCheckUtils]: 87: Hoare triple {14959#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:58,197 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14959#(<= main_~i~0 20)} is VALID [2018-11-14 16:57:58,198 INFO L273 TraceCheckUtils]: 89: Hoare triple {14959#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:58,198 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#(<= main_~i~0 21)} assume true; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:58,199 INFO L273 TraceCheckUtils]: 91: Hoare triple {14960#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:58,199 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14960#(<= main_~i~0 21)} is VALID [2018-11-14 16:57:58,200 INFO L273 TraceCheckUtils]: 93: Hoare triple {14960#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:58,200 INFO L273 TraceCheckUtils]: 94: Hoare triple {14961#(<= main_~i~0 22)} assume true; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:58,201 INFO L273 TraceCheckUtils]: 95: Hoare triple {14961#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:58,210 INFO L273 TraceCheckUtils]: 96: Hoare triple {14961#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14961#(<= main_~i~0 22)} is VALID [2018-11-14 16:57:58,211 INFO L273 TraceCheckUtils]: 97: Hoare triple {14961#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:58,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {14962#(<= main_~i~0 23)} assume true; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:58,212 INFO L273 TraceCheckUtils]: 99: Hoare triple {14962#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:58,212 INFO L273 TraceCheckUtils]: 100: Hoare triple {14962#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14962#(<= main_~i~0 23)} is VALID [2018-11-14 16:57:58,212 INFO L273 TraceCheckUtils]: 101: Hoare triple {14962#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:58,213 INFO L273 TraceCheckUtils]: 102: Hoare triple {14963#(<= main_~i~0 24)} assume true; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:58,213 INFO L273 TraceCheckUtils]: 103: Hoare triple {14963#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:58,213 INFO L273 TraceCheckUtils]: 104: Hoare triple {14963#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {14963#(<= main_~i~0 24)} is VALID [2018-11-14 16:57:58,214 INFO L273 TraceCheckUtils]: 105: Hoare triple {14963#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {14964#(<= main_~i~0 25)} is VALID [2018-11-14 16:57:58,214 INFO L273 TraceCheckUtils]: 106: Hoare triple {14964#(<= main_~i~0 25)} assume true; {14964#(<= main_~i~0 25)} is VALID [2018-11-14 16:57:58,215 INFO L273 TraceCheckUtils]: 107: Hoare triple {14964#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14938#false} is VALID [2018-11-14 16:57:58,215 INFO L273 TraceCheckUtils]: 108: Hoare triple {14938#false} havoc ~x~0;~x~0 := 0; {14938#false} is VALID [2018-11-14 16:57:58,215 INFO L273 TraceCheckUtils]: 109: Hoare triple {14938#false} assume true; {14938#false} is VALID [2018-11-14 16:57:58,216 INFO L273 TraceCheckUtils]: 110: Hoare triple {14938#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {14938#false} is VALID [2018-11-14 16:57:58,216 INFO L256 TraceCheckUtils]: 111: Hoare triple {14938#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14938#false} is VALID [2018-11-14 16:57:58,216 INFO L273 TraceCheckUtils]: 112: Hoare triple {14938#false} ~cond := #in~cond; {14938#false} is VALID [2018-11-14 16:57:58,216 INFO L273 TraceCheckUtils]: 113: Hoare triple {14938#false} assume ~cond == 0; {14938#false} is VALID [2018-11-14 16:57:58,216 INFO L273 TraceCheckUtils]: 114: Hoare triple {14938#false} assume !false; {14938#false} is VALID [2018-11-14 16:57:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:57:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 16:57:58,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-14 16:57:58,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:58,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 16:57:58,359 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:57:58,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 16:57:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 16:57:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:57:58,361 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 29 states. [2018-11-14 16:57:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:59,125 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2018-11-14 16:57:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 16:57:59,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-14 16:57:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:57:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:57:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 183 transitions. [2018-11-14 16:57:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:57:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 183 transitions. [2018-11-14 16:57:59,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 183 transitions. [2018-11-14 16:57:59,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:59,294 INFO L225 Difference]: With dead ends: 150 [2018-11-14 16:57:59,294 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 16:57:59,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:57:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 16:57:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-14 16:57:59,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:57:59,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2018-11-14 16:57:59,319 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2018-11-14 16:57:59,319 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2018-11-14 16:57:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:59,321 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-14 16:57:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-14 16:57:59,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:59,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:59,322 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2018-11-14 16:57:59,322 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2018-11-14 16:57:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:57:59,324 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-14 16:57:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-14 16:57:59,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:57:59,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:57:59,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:57:59,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:57:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-14 16:57:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2018-11-14 16:57:59,327 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 115 [2018-11-14 16:57:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:57:59,328 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2018-11-14 16:57:59,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 16:57:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-14 16:57:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-14 16:57:59,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:57:59,329 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:57:59,329 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:57:59,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:57:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash -423833048, now seen corresponding path program 26 times [2018-11-14 16:57:59,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:57:59,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:57:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:57:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:57:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:00,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {15931#true} call ULTIMATE.init(); {15931#true} is VALID [2018-11-14 16:58:00,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {15931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15931#true} is VALID [2018-11-14 16:58:00,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {15931#true} assume true; {15931#true} is VALID [2018-11-14 16:58:00,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15931#true} {15931#true} #73#return; {15931#true} is VALID [2018-11-14 16:58:00,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {15931#true} call #t~ret7 := main(); {15931#true} is VALID [2018-11-14 16:58:00,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {15931#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15933#(= main_~i~0 0)} is VALID [2018-11-14 16:58:00,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {15933#(= main_~i~0 0)} assume true; {15933#(= main_~i~0 0)} is VALID [2018-11-14 16:58:00,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {15933#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15933#(= main_~i~0 0)} is VALID [2018-11-14 16:58:00,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {15933#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15933#(= main_~i~0 0)} is VALID [2018-11-14 16:58:00,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {15933#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {15934#(<= main_~i~0 1)} assume true; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {15934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {15934#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {15934#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(<= main_~i~0 2)} assume true; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {15935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {15935#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {15935#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {15936#(<= main_~i~0 3)} assume true; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {15936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {15936#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {15936#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {15937#(<= main_~i~0 4)} assume true; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {15937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {15937#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {15937#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {15938#(<= main_~i~0 5)} assume true; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {15938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {15938#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {15938#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {15939#(<= main_~i~0 6)} assume true; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {15939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {15939#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {15939#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {15940#(<= main_~i~0 7)} assume true; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {15940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {15940#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {15940#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {15941#(<= main_~i~0 8)} assume true; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {15941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {15941#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {15941#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {15942#(<= main_~i~0 9)} assume true; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {15942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {15942#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {15942#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,430 INFO L273 TraceCheckUtils]: 46: Hoare triple {15943#(<= main_~i~0 10)} assume true; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {15943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,448 INFO L273 TraceCheckUtils]: 48: Hoare triple {15943#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {15943#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,449 INFO L273 TraceCheckUtils]: 50: Hoare triple {15944#(<= main_~i~0 11)} assume true; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,449 INFO L273 TraceCheckUtils]: 51: Hoare triple {15944#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,449 INFO L273 TraceCheckUtils]: 52: Hoare triple {15944#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,450 INFO L273 TraceCheckUtils]: 53: Hoare triple {15944#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,450 INFO L273 TraceCheckUtils]: 54: Hoare triple {15945#(<= main_~i~0 12)} assume true; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,450 INFO L273 TraceCheckUtils]: 55: Hoare triple {15945#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,451 INFO L273 TraceCheckUtils]: 56: Hoare triple {15945#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,451 INFO L273 TraceCheckUtils]: 57: Hoare triple {15945#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {15946#(<= main_~i~0 13)} assume true; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {15946#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {15946#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {15946#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {15947#(<= main_~i~0 14)} assume true; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {15947#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {15947#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {15947#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,455 INFO L273 TraceCheckUtils]: 66: Hoare triple {15948#(<= main_~i~0 15)} assume true; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {15948#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,456 INFO L273 TraceCheckUtils]: 68: Hoare triple {15948#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {15948#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {15949#(<= main_~i~0 16)} assume true; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {15949#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {15949#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {15949#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,459 INFO L273 TraceCheckUtils]: 74: Hoare triple {15950#(<= main_~i~0 17)} assume true; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {15950#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,460 INFO L273 TraceCheckUtils]: 76: Hoare triple {15950#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {15950#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,461 INFO L273 TraceCheckUtils]: 78: Hoare triple {15951#(<= main_~i~0 18)} assume true; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {15951#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {15951#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,463 INFO L273 TraceCheckUtils]: 81: Hoare triple {15951#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,463 INFO L273 TraceCheckUtils]: 82: Hoare triple {15952#(<= main_~i~0 19)} assume true; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {15952#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,464 INFO L273 TraceCheckUtils]: 84: Hoare triple {15952#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {15952#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {15953#(<= main_~i~0 20)} assume true; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,466 INFO L273 TraceCheckUtils]: 87: Hoare triple {15953#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {15953#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,467 INFO L273 TraceCheckUtils]: 89: Hoare triple {15953#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,467 INFO L273 TraceCheckUtils]: 90: Hoare triple {15954#(<= main_~i~0 21)} assume true; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {15954#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,479 INFO L273 TraceCheckUtils]: 92: Hoare triple {15954#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,479 INFO L273 TraceCheckUtils]: 93: Hoare triple {15954#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,480 INFO L273 TraceCheckUtils]: 94: Hoare triple {15955#(<= main_~i~0 22)} assume true; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,480 INFO L273 TraceCheckUtils]: 95: Hoare triple {15955#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,481 INFO L273 TraceCheckUtils]: 96: Hoare triple {15955#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,481 INFO L273 TraceCheckUtils]: 97: Hoare triple {15955#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,482 INFO L273 TraceCheckUtils]: 98: Hoare triple {15956#(<= main_~i~0 23)} assume true; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,482 INFO L273 TraceCheckUtils]: 99: Hoare triple {15956#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,482 INFO L273 TraceCheckUtils]: 100: Hoare triple {15956#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {15956#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {15957#(<= main_~i~0 24)} assume true; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {15957#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,485 INFO L273 TraceCheckUtils]: 104: Hoare triple {15957#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {15957#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,486 INFO L273 TraceCheckUtils]: 106: Hoare triple {15958#(<= main_~i~0 25)} assume true; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,486 INFO L273 TraceCheckUtils]: 107: Hoare triple {15958#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,487 INFO L273 TraceCheckUtils]: 108: Hoare triple {15958#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,487 INFO L273 TraceCheckUtils]: 109: Hoare triple {15958#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15959#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:00,488 INFO L273 TraceCheckUtils]: 110: Hoare triple {15959#(<= main_~i~0 26)} assume true; {15959#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:00,488 INFO L273 TraceCheckUtils]: 111: Hoare triple {15959#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15932#false} is VALID [2018-11-14 16:58:00,489 INFO L273 TraceCheckUtils]: 112: Hoare triple {15932#false} havoc ~x~0;~x~0 := 0; {15932#false} is VALID [2018-11-14 16:58:00,489 INFO L273 TraceCheckUtils]: 113: Hoare triple {15932#false} assume true; {15932#false} is VALID [2018-11-14 16:58:00,489 INFO L273 TraceCheckUtils]: 114: Hoare triple {15932#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {15932#false} is VALID [2018-11-14 16:58:00,489 INFO L256 TraceCheckUtils]: 115: Hoare triple {15932#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15932#false} is VALID [2018-11-14 16:58:00,489 INFO L273 TraceCheckUtils]: 116: Hoare triple {15932#false} ~cond := #in~cond; {15932#false} is VALID [2018-11-14 16:58:00,490 INFO L273 TraceCheckUtils]: 117: Hoare triple {15932#false} assume ~cond == 0; {15932#false} is VALID [2018-11-14 16:58:00,490 INFO L273 TraceCheckUtils]: 118: Hoare triple {15932#false} assume !false; {15932#false} is VALID [2018-11-14 16:58:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:00,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:00,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:00,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:58:00,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:58:00,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:00,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:00,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {15931#true} call ULTIMATE.init(); {15931#true} is VALID [2018-11-14 16:58:00,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {15931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15931#true} is VALID [2018-11-14 16:58:00,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {15931#true} assume true; {15931#true} is VALID [2018-11-14 16:58:00,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15931#true} {15931#true} #73#return; {15931#true} is VALID [2018-11-14 16:58:00,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {15931#true} call #t~ret7 := main(); {15931#true} is VALID [2018-11-14 16:58:00,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {15931#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15978#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:00,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {15978#(<= main_~i~0 0)} assume true; {15978#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:00,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {15978#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15978#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:00,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {15978#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15978#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:00,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {15978#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {15934#(<= main_~i~0 1)} assume true; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {15934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {15934#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15934#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:00,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {15934#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(<= main_~i~0 2)} assume true; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {15935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {15935#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15935#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:00,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {15935#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {15936#(<= main_~i~0 3)} assume true; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {15936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {15936#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15936#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:00,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {15936#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {15937#(<= main_~i~0 4)} assume true; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {15937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {15937#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15937#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:00,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {15937#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {15938#(<= main_~i~0 5)} assume true; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {15938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {15938#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15938#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:00,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {15938#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {15939#(<= main_~i~0 6)} assume true; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {15939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {15939#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15939#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:00,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {15939#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {15940#(<= main_~i~0 7)} assume true; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {15940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {15940#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15940#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:00,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {15940#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {15941#(<= main_~i~0 8)} assume true; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {15941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {15941#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15941#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:00,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {15941#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {15942#(<= main_~i~0 9)} assume true; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {15942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,869 INFO L273 TraceCheckUtils]: 44: Hoare triple {15942#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15942#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:00,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {15942#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {15943#(<= main_~i~0 10)} assume true; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {15943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {15943#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15943#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:00,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {15943#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {15944#(<= main_~i~0 11)} assume true; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {15944#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,929 INFO L273 TraceCheckUtils]: 52: Hoare triple {15944#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15944#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:00,931 INFO L273 TraceCheckUtils]: 53: Hoare triple {15944#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {15945#(<= main_~i~0 12)} assume true; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,933 INFO L273 TraceCheckUtils]: 55: Hoare triple {15945#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {15945#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15945#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:00,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {15945#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {15946#(<= main_~i~0 13)} assume true; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {15946#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {15946#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15946#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:00,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {15946#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {15947#(<= main_~i~0 14)} assume true; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {15947#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {15947#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15947#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:00,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {15947#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {15948#(<= main_~i~0 15)} assume true; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {15948#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,937 INFO L273 TraceCheckUtils]: 68: Hoare triple {15948#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15948#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:00,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {15948#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {15949#(<= main_~i~0 16)} assume true; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {15949#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,939 INFO L273 TraceCheckUtils]: 72: Hoare triple {15949#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15949#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:00,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {15949#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,940 INFO L273 TraceCheckUtils]: 74: Hoare triple {15950#(<= main_~i~0 17)} assume true; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,940 INFO L273 TraceCheckUtils]: 75: Hoare triple {15950#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,941 INFO L273 TraceCheckUtils]: 76: Hoare triple {15950#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15950#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:00,941 INFO L273 TraceCheckUtils]: 77: Hoare triple {15950#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,942 INFO L273 TraceCheckUtils]: 78: Hoare triple {15951#(<= main_~i~0 18)} assume true; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,942 INFO L273 TraceCheckUtils]: 79: Hoare triple {15951#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,943 INFO L273 TraceCheckUtils]: 80: Hoare triple {15951#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15951#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:00,944 INFO L273 TraceCheckUtils]: 81: Hoare triple {15951#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,944 INFO L273 TraceCheckUtils]: 82: Hoare triple {15952#(<= main_~i~0 19)} assume true; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,945 INFO L273 TraceCheckUtils]: 83: Hoare triple {15952#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,945 INFO L273 TraceCheckUtils]: 84: Hoare triple {15952#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15952#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:00,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {15952#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,946 INFO L273 TraceCheckUtils]: 86: Hoare triple {15953#(<= main_~i~0 20)} assume true; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,947 INFO L273 TraceCheckUtils]: 87: Hoare triple {15953#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,947 INFO L273 TraceCheckUtils]: 88: Hoare triple {15953#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15953#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:00,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {15953#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,948 INFO L273 TraceCheckUtils]: 90: Hoare triple {15954#(<= main_~i~0 21)} assume true; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,949 INFO L273 TraceCheckUtils]: 91: Hoare triple {15954#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,949 INFO L273 TraceCheckUtils]: 92: Hoare triple {15954#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15954#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:00,950 INFO L273 TraceCheckUtils]: 93: Hoare triple {15954#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,950 INFO L273 TraceCheckUtils]: 94: Hoare triple {15955#(<= main_~i~0 22)} assume true; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,951 INFO L273 TraceCheckUtils]: 95: Hoare triple {15955#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,951 INFO L273 TraceCheckUtils]: 96: Hoare triple {15955#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15955#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:00,952 INFO L273 TraceCheckUtils]: 97: Hoare triple {15955#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,953 INFO L273 TraceCheckUtils]: 98: Hoare triple {15956#(<= main_~i~0 23)} assume true; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,953 INFO L273 TraceCheckUtils]: 99: Hoare triple {15956#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,953 INFO L273 TraceCheckUtils]: 100: Hoare triple {15956#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15956#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:00,954 INFO L273 TraceCheckUtils]: 101: Hoare triple {15956#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,955 INFO L273 TraceCheckUtils]: 102: Hoare triple {15957#(<= main_~i~0 24)} assume true; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,955 INFO L273 TraceCheckUtils]: 103: Hoare triple {15957#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,956 INFO L273 TraceCheckUtils]: 104: Hoare triple {15957#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15957#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:00,956 INFO L273 TraceCheckUtils]: 105: Hoare triple {15957#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,957 INFO L273 TraceCheckUtils]: 106: Hoare triple {15958#(<= main_~i~0 25)} assume true; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,957 INFO L273 TraceCheckUtils]: 107: Hoare triple {15958#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,958 INFO L273 TraceCheckUtils]: 108: Hoare triple {15958#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {15958#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:00,958 INFO L273 TraceCheckUtils]: 109: Hoare triple {15958#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {15959#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:00,959 INFO L273 TraceCheckUtils]: 110: Hoare triple {15959#(<= main_~i~0 26)} assume true; {15959#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:00,959 INFO L273 TraceCheckUtils]: 111: Hoare triple {15959#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15932#false} is VALID [2018-11-14 16:58:00,960 INFO L273 TraceCheckUtils]: 112: Hoare triple {15932#false} havoc ~x~0;~x~0 := 0; {15932#false} is VALID [2018-11-14 16:58:00,960 INFO L273 TraceCheckUtils]: 113: Hoare triple {15932#false} assume true; {15932#false} is VALID [2018-11-14 16:58:00,960 INFO L273 TraceCheckUtils]: 114: Hoare triple {15932#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {15932#false} is VALID [2018-11-14 16:58:00,960 INFO L256 TraceCheckUtils]: 115: Hoare triple {15932#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15932#false} is VALID [2018-11-14 16:58:00,960 INFO L273 TraceCheckUtils]: 116: Hoare triple {15932#false} ~cond := #in~cond; {15932#false} is VALID [2018-11-14 16:58:00,961 INFO L273 TraceCheckUtils]: 117: Hoare triple {15932#false} assume ~cond == 0; {15932#false} is VALID [2018-11-14 16:58:00,961 INFO L273 TraceCheckUtils]: 118: Hoare triple {15932#false} assume !false; {15932#false} is VALID [2018-11-14 16:58:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:00,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 16:58:00,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-14 16:58:00,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:00,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 16:58:01,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:01,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 16:58:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 16:58:01,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:58:01,105 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 30 states. [2018-11-14 16:58:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:01,918 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-11-14 16:58:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 16:58:01,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-14 16:58:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:58:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 188 transitions. [2018-11-14 16:58:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:58:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 188 transitions. [2018-11-14 16:58:01,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 188 transitions. [2018-11-14 16:58:02,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:02,105 INFO L225 Difference]: With dead ends: 154 [2018-11-14 16:58:02,105 INFO L226 Difference]: Without dead ends: 136 [2018-11-14 16:58:02,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:58:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-14 16:58:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-14 16:58:02,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:02,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-14 16:58:02,131 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-14 16:58:02,132 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-14 16:58:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:02,134 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2018-11-14 16:58:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2018-11-14 16:58:02,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:02,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:02,134 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-14 16:58:02,135 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-14 16:58:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:02,137 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2018-11-14 16:58:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2018-11-14 16:58:02,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:02,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:02,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:02,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 16:58:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 164 transitions. [2018-11-14 16:58:02,141 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 164 transitions. Word has length 119 [2018-11-14 16:58:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:02,141 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 164 transitions. [2018-11-14 16:58:02,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 16:58:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-14 16:58:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-14 16:58:02,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:02,142 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:02,143 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:02,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1601581375, now seen corresponding path program 27 times [2018-11-14 16:58:02,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:02,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:02,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:02,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:02,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:02,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {16956#true} call ULTIMATE.init(); {16956#true} is VALID [2018-11-14 16:58:02,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {16956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16956#true} is VALID [2018-11-14 16:58:02,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {16956#true} assume true; {16956#true} is VALID [2018-11-14 16:58:02,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16956#true} {16956#true} #73#return; {16956#true} is VALID [2018-11-14 16:58:02,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {16956#true} call #t~ret7 := main(); {16956#true} is VALID [2018-11-14 16:58:02,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {16956#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {16958#(= main_~i~0 0)} is VALID [2018-11-14 16:58:02,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {16958#(= main_~i~0 0)} assume true; {16958#(= main_~i~0 0)} is VALID [2018-11-14 16:58:02,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {16958#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16958#(= main_~i~0 0)} is VALID [2018-11-14 16:58:02,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {16958#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16958#(= main_~i~0 0)} is VALID [2018-11-14 16:58:02,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {16958#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:02,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {16959#(<= main_~i~0 1)} assume true; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:02,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {16959#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:02,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {16959#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:02,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {16959#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:02,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {16960#(<= main_~i~0 2)} assume true; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:02,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {16960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:02,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {16960#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:02,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {16960#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:02,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {16961#(<= main_~i~0 3)} assume true; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:02,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {16961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:02,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {16961#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:02,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {16961#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:02,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {16962#(<= main_~i~0 4)} assume true; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:02,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {16962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:02,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {16962#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:02,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {16962#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:02,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {16963#(<= main_~i~0 5)} assume true; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:02,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {16963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:02,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {16963#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:02,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {16963#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:02,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {16964#(<= main_~i~0 6)} assume true; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:02,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {16964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:02,900 INFO L273 TraceCheckUtils]: 32: Hoare triple {16964#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:02,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {16964#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:02,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {16965#(<= main_~i~0 7)} assume true; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:02,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {16965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:02,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {16965#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:02,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {16965#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:02,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {16966#(<= main_~i~0 8)} assume true; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:02,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {16966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:02,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {16966#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:02,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {16966#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:02,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {16967#(<= main_~i~0 9)} assume true; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:02,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {16967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:02,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {16967#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:02,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {16967#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:02,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {16968#(<= main_~i~0 10)} assume true; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:02,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {16968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:02,910 INFO L273 TraceCheckUtils]: 48: Hoare triple {16968#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:02,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {16968#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:02,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {16969#(<= main_~i~0 11)} assume true; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:02,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {16969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:02,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {16969#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:02,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {16969#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:02,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {16970#(<= main_~i~0 12)} assume true; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:02,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {16970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:02,915 INFO L273 TraceCheckUtils]: 56: Hoare triple {16970#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:02,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {16970#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:02,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {16971#(<= main_~i~0 13)} assume true; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:02,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {16971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:02,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {16971#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:02,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {16971#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:02,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {16972#(<= main_~i~0 14)} assume true; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:02,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {16972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:02,920 INFO L273 TraceCheckUtils]: 64: Hoare triple {16972#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:02,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {16972#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:02,921 INFO L273 TraceCheckUtils]: 66: Hoare triple {16973#(<= main_~i~0 15)} assume true; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:02,922 INFO L273 TraceCheckUtils]: 67: Hoare triple {16973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:02,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {16973#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:02,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {16973#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:02,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {16974#(<= main_~i~0 16)} assume true; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:02,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {16974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:02,945 INFO L273 TraceCheckUtils]: 72: Hoare triple {16974#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:02,946 INFO L273 TraceCheckUtils]: 73: Hoare triple {16974#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:02,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {16975#(<= main_~i~0 17)} assume true; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:02,946 INFO L273 TraceCheckUtils]: 75: Hoare triple {16975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:02,947 INFO L273 TraceCheckUtils]: 76: Hoare triple {16975#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:02,947 INFO L273 TraceCheckUtils]: 77: Hoare triple {16975#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:02,947 INFO L273 TraceCheckUtils]: 78: Hoare triple {16976#(<= main_~i~0 18)} assume true; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:02,948 INFO L273 TraceCheckUtils]: 79: Hoare triple {16976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:02,948 INFO L273 TraceCheckUtils]: 80: Hoare triple {16976#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:02,948 INFO L273 TraceCheckUtils]: 81: Hoare triple {16976#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:02,949 INFO L273 TraceCheckUtils]: 82: Hoare triple {16977#(<= main_~i~0 19)} assume true; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:02,949 INFO L273 TraceCheckUtils]: 83: Hoare triple {16977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:02,950 INFO L273 TraceCheckUtils]: 84: Hoare triple {16977#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:02,951 INFO L273 TraceCheckUtils]: 85: Hoare triple {16977#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:02,951 INFO L273 TraceCheckUtils]: 86: Hoare triple {16978#(<= main_~i~0 20)} assume true; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:02,951 INFO L273 TraceCheckUtils]: 87: Hoare triple {16978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:02,952 INFO L273 TraceCheckUtils]: 88: Hoare triple {16978#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:02,953 INFO L273 TraceCheckUtils]: 89: Hoare triple {16978#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:02,953 INFO L273 TraceCheckUtils]: 90: Hoare triple {16979#(<= main_~i~0 21)} assume true; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:02,954 INFO L273 TraceCheckUtils]: 91: Hoare triple {16979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:02,954 INFO L273 TraceCheckUtils]: 92: Hoare triple {16979#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:02,955 INFO L273 TraceCheckUtils]: 93: Hoare triple {16979#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:02,955 INFO L273 TraceCheckUtils]: 94: Hoare triple {16980#(<= main_~i~0 22)} assume true; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:02,956 INFO L273 TraceCheckUtils]: 95: Hoare triple {16980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:02,956 INFO L273 TraceCheckUtils]: 96: Hoare triple {16980#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:02,957 INFO L273 TraceCheckUtils]: 97: Hoare triple {16980#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:02,957 INFO L273 TraceCheckUtils]: 98: Hoare triple {16981#(<= main_~i~0 23)} assume true; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:02,958 INFO L273 TraceCheckUtils]: 99: Hoare triple {16981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:02,958 INFO L273 TraceCheckUtils]: 100: Hoare triple {16981#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:02,959 INFO L273 TraceCheckUtils]: 101: Hoare triple {16981#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:02,959 INFO L273 TraceCheckUtils]: 102: Hoare triple {16982#(<= main_~i~0 24)} assume true; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:02,960 INFO L273 TraceCheckUtils]: 103: Hoare triple {16982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:02,960 INFO L273 TraceCheckUtils]: 104: Hoare triple {16982#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:02,961 INFO L273 TraceCheckUtils]: 105: Hoare triple {16982#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:02,962 INFO L273 TraceCheckUtils]: 106: Hoare triple {16983#(<= main_~i~0 25)} assume true; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:02,962 INFO L273 TraceCheckUtils]: 107: Hoare triple {16983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:02,962 INFO L273 TraceCheckUtils]: 108: Hoare triple {16983#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:02,963 INFO L273 TraceCheckUtils]: 109: Hoare triple {16983#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:02,964 INFO L273 TraceCheckUtils]: 110: Hoare triple {16984#(<= main_~i~0 26)} assume true; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:02,964 INFO L273 TraceCheckUtils]: 111: Hoare triple {16984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:02,965 INFO L273 TraceCheckUtils]: 112: Hoare triple {16984#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:02,965 INFO L273 TraceCheckUtils]: 113: Hoare triple {16984#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16985#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:02,966 INFO L273 TraceCheckUtils]: 114: Hoare triple {16985#(<= main_~i~0 27)} assume true; {16985#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:02,966 INFO L273 TraceCheckUtils]: 115: Hoare triple {16985#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L273 TraceCheckUtils]: 116: Hoare triple {16957#false} havoc ~x~0;~x~0 := 0; {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L273 TraceCheckUtils]: 117: Hoare triple {16957#false} assume true; {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L273 TraceCheckUtils]: 118: Hoare triple {16957#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L256 TraceCheckUtils]: 119: Hoare triple {16957#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L273 TraceCheckUtils]: 120: Hoare triple {16957#false} ~cond := #in~cond; {16957#false} is VALID [2018-11-14 16:58:02,967 INFO L273 TraceCheckUtils]: 121: Hoare triple {16957#false} assume ~cond == 0; {16957#false} is VALID [2018-11-14 16:58:02,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {16957#false} assume !false; {16957#false} is VALID [2018-11-14 16:58:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:02,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:02,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:58:04,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 16:58:04,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:04,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:05,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {16956#true} call ULTIMATE.init(); {16956#true} is VALID [2018-11-14 16:58:05,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {16956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16956#true} is VALID [2018-11-14 16:58:05,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {16956#true} assume true; {16956#true} is VALID [2018-11-14 16:58:05,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16956#true} {16956#true} #73#return; {16956#true} is VALID [2018-11-14 16:58:05,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {16956#true} call #t~ret7 := main(); {16956#true} is VALID [2018-11-14 16:58:05,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {16956#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {17004#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:05,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {17004#(<= main_~i~0 0)} assume true; {17004#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:05,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {17004#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {17004#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:05,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {17004#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {17004#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:05,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {17004#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:05,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {16959#(<= main_~i~0 1)} assume true; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:05,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {16959#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:05,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {16959#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16959#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:05,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {16959#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:05,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {16960#(<= main_~i~0 2)} assume true; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:05,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {16960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:05,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {16960#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16960#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:05,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {16960#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:05,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {16961#(<= main_~i~0 3)} assume true; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:05,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {16961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:05,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {16961#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16961#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:05,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {16961#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:05,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {16962#(<= main_~i~0 4)} assume true; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:05,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {16962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:05,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {16962#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16962#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:05,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {16962#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:05,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {16963#(<= main_~i~0 5)} assume true; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:05,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {16963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:05,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {16963#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16963#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:05,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {16963#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:05,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {16964#(<= main_~i~0 6)} assume true; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:05,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {16964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:05,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {16964#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16964#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:05,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {16964#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:05,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {16965#(<= main_~i~0 7)} assume true; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:05,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {16965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:05,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {16965#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16965#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:05,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {16965#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:05,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {16966#(<= main_~i~0 8)} assume true; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:05,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {16966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:05,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {16966#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16966#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:05,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {16966#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:05,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {16967#(<= main_~i~0 9)} assume true; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:05,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {16967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:05,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {16967#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16967#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:05,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {16967#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:05,912 INFO L273 TraceCheckUtils]: 46: Hoare triple {16968#(<= main_~i~0 10)} assume true; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:05,913 INFO L273 TraceCheckUtils]: 47: Hoare triple {16968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:05,913 INFO L273 TraceCheckUtils]: 48: Hoare triple {16968#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16968#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:05,914 INFO L273 TraceCheckUtils]: 49: Hoare triple {16968#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:05,914 INFO L273 TraceCheckUtils]: 50: Hoare triple {16969#(<= main_~i~0 11)} assume true; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:05,915 INFO L273 TraceCheckUtils]: 51: Hoare triple {16969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:05,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {16969#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16969#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:05,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {16969#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:05,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {16970#(<= main_~i~0 12)} assume true; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:05,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {16970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:05,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {16970#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16970#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:05,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {16970#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:05,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {16971#(<= main_~i~0 13)} assume true; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:05,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {16971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:05,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {16971#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16971#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:05,920 INFO L273 TraceCheckUtils]: 61: Hoare triple {16971#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:05,921 INFO L273 TraceCheckUtils]: 62: Hoare triple {16972#(<= main_~i~0 14)} assume true; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:05,921 INFO L273 TraceCheckUtils]: 63: Hoare triple {16972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:05,921 INFO L273 TraceCheckUtils]: 64: Hoare triple {16972#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16972#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:05,922 INFO L273 TraceCheckUtils]: 65: Hoare triple {16972#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:05,923 INFO L273 TraceCheckUtils]: 66: Hoare triple {16973#(<= main_~i~0 15)} assume true; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:05,923 INFO L273 TraceCheckUtils]: 67: Hoare triple {16973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:05,924 INFO L273 TraceCheckUtils]: 68: Hoare triple {16973#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16973#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:05,924 INFO L273 TraceCheckUtils]: 69: Hoare triple {16973#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:05,925 INFO L273 TraceCheckUtils]: 70: Hoare triple {16974#(<= main_~i~0 16)} assume true; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:05,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {16974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:05,926 INFO L273 TraceCheckUtils]: 72: Hoare triple {16974#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16974#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:05,926 INFO L273 TraceCheckUtils]: 73: Hoare triple {16974#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:05,927 INFO L273 TraceCheckUtils]: 74: Hoare triple {16975#(<= main_~i~0 17)} assume true; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:05,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {16975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:05,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {16975#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16975#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:05,928 INFO L273 TraceCheckUtils]: 77: Hoare triple {16975#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:05,929 INFO L273 TraceCheckUtils]: 78: Hoare triple {16976#(<= main_~i~0 18)} assume true; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:05,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {16976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:05,930 INFO L273 TraceCheckUtils]: 80: Hoare triple {16976#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16976#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:05,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {16976#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:05,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {16977#(<= main_~i~0 19)} assume true; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:05,932 INFO L273 TraceCheckUtils]: 83: Hoare triple {16977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:05,932 INFO L273 TraceCheckUtils]: 84: Hoare triple {16977#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16977#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:05,933 INFO L273 TraceCheckUtils]: 85: Hoare triple {16977#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:05,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {16978#(<= main_~i~0 20)} assume true; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:05,934 INFO L273 TraceCheckUtils]: 87: Hoare triple {16978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:05,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {16978#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16978#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:05,935 INFO L273 TraceCheckUtils]: 89: Hoare triple {16978#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:05,935 INFO L273 TraceCheckUtils]: 90: Hoare triple {16979#(<= main_~i~0 21)} assume true; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:05,936 INFO L273 TraceCheckUtils]: 91: Hoare triple {16979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:05,936 INFO L273 TraceCheckUtils]: 92: Hoare triple {16979#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16979#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:05,937 INFO L273 TraceCheckUtils]: 93: Hoare triple {16979#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:05,937 INFO L273 TraceCheckUtils]: 94: Hoare triple {16980#(<= main_~i~0 22)} assume true; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:05,938 INFO L273 TraceCheckUtils]: 95: Hoare triple {16980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:05,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {16980#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16980#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:05,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {16980#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:05,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {16981#(<= main_~i~0 23)} assume true; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:05,940 INFO L273 TraceCheckUtils]: 99: Hoare triple {16981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:05,940 INFO L273 TraceCheckUtils]: 100: Hoare triple {16981#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16981#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:05,941 INFO L273 TraceCheckUtils]: 101: Hoare triple {16981#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:05,942 INFO L273 TraceCheckUtils]: 102: Hoare triple {16982#(<= main_~i~0 24)} assume true; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:05,942 INFO L273 TraceCheckUtils]: 103: Hoare triple {16982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:05,943 INFO L273 TraceCheckUtils]: 104: Hoare triple {16982#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16982#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:05,943 INFO L273 TraceCheckUtils]: 105: Hoare triple {16982#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:05,944 INFO L273 TraceCheckUtils]: 106: Hoare triple {16983#(<= main_~i~0 25)} assume true; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:05,944 INFO L273 TraceCheckUtils]: 107: Hoare triple {16983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:05,945 INFO L273 TraceCheckUtils]: 108: Hoare triple {16983#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16983#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:05,945 INFO L273 TraceCheckUtils]: 109: Hoare triple {16983#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:05,946 INFO L273 TraceCheckUtils]: 110: Hoare triple {16984#(<= main_~i~0 26)} assume true; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:05,946 INFO L273 TraceCheckUtils]: 111: Hoare triple {16984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:05,947 INFO L273 TraceCheckUtils]: 112: Hoare triple {16984#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {16984#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:05,948 INFO L273 TraceCheckUtils]: 113: Hoare triple {16984#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {16985#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:05,948 INFO L273 TraceCheckUtils]: 114: Hoare triple {16985#(<= main_~i~0 27)} assume true; {16985#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:05,949 INFO L273 TraceCheckUtils]: 115: Hoare triple {16985#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16957#false} is VALID [2018-11-14 16:58:05,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {16957#false} havoc ~x~0;~x~0 := 0; {16957#false} is VALID [2018-11-14 16:58:05,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {16957#false} assume true; {16957#false} is VALID [2018-11-14 16:58:05,949 INFO L273 TraceCheckUtils]: 118: Hoare triple {16957#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {16957#false} is VALID [2018-11-14 16:58:05,949 INFO L256 TraceCheckUtils]: 119: Hoare triple {16957#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16957#false} is VALID [2018-11-14 16:58:05,950 INFO L273 TraceCheckUtils]: 120: Hoare triple {16957#false} ~cond := #in~cond; {16957#false} is VALID [2018-11-14 16:58:05,950 INFO L273 TraceCheckUtils]: 121: Hoare triple {16957#false} assume ~cond == 0; {16957#false} is VALID [2018-11-14 16:58:05,950 INFO L273 TraceCheckUtils]: 122: Hoare triple {16957#false} assume !false; {16957#false} is VALID [2018-11-14 16:58:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 16:58:05,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-14 16:58:05,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:05,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:58:06,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:06,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:58:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:58:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:58:06,104 INFO L87 Difference]: Start difference. First operand 134 states and 164 transitions. Second operand 31 states. [2018-11-14 16:58:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:07,096 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2018-11-14 16:58:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 16:58:07,096 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-14 16:58:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:58:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 193 transitions. [2018-11-14 16:58:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:58:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 193 transitions. [2018-11-14 16:58:07,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 193 transitions. [2018-11-14 16:58:07,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:07,281 INFO L225 Difference]: With dead ends: 158 [2018-11-14 16:58:07,281 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 16:58:07,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:58:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 16:58:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-14 16:58:07,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:07,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-14 16:58:07,317 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-14 16:58:07,317 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-14 16:58:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:07,320 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2018-11-14 16:58:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2018-11-14 16:58:07,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:07,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:07,321 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-14 16:58:07,321 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-14 16:58:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:07,324 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2018-11-14 16:58:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2018-11-14 16:58:07,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:07,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:07,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:07,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-14 16:58:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2018-11-14 16:58:07,327 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 123 [2018-11-14 16:58:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:07,328 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2018-11-14 16:58:07,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 16:58:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-14 16:58:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-14 16:58:07,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:07,329 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:07,329 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:07,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:07,329 INFO L82 PathProgramCache]: Analyzing trace with hash 262941910, now seen corresponding path program 28 times [2018-11-14 16:58:07,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:07,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:07,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:07,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2018-11-14 16:58:07,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18012#true} is VALID [2018-11-14 16:58:07,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2018-11-14 16:58:07,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #73#return; {18012#true} is VALID [2018-11-14 16:58:07,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret7 := main(); {18012#true} is VALID [2018-11-14 16:58:07,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {18012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18014#(= main_~i~0 0)} is VALID [2018-11-14 16:58:07,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {18014#(= main_~i~0 0)} assume true; {18014#(= main_~i~0 0)} is VALID [2018-11-14 16:58:07,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {18014#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18014#(= main_~i~0 0)} is VALID [2018-11-14 16:58:07,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {18014#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18014#(= main_~i~0 0)} is VALID [2018-11-14 16:58:07,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {18014#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:07,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {18015#(<= main_~i~0 1)} assume true; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:07,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {18015#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:07,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {18015#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:07,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {18015#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:07,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {18016#(<= main_~i~0 2)} assume true; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:07,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {18016#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:07,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {18016#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:07,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {18016#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:07,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {18017#(<= main_~i~0 3)} assume true; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:07,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {18017#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:07,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {18017#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:07,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {18017#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:07,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {18018#(<= main_~i~0 4)} assume true; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:07,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {18018#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:07,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {18018#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:07,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {18018#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:07,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {18019#(<= main_~i~0 5)} assume true; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:07,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {18019#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:07,887 INFO L273 TraceCheckUtils]: 28: Hoare triple {18019#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:07,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {18019#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:07,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {18020#(<= main_~i~0 6)} assume true; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:07,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {18020#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:07,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {18020#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:07,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {18020#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:07,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {18021#(<= main_~i~0 7)} assume true; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:07,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {18021#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:07,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {18021#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:07,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {18021#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:07,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {18022#(<= main_~i~0 8)} assume true; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:07,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {18022#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:07,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {18022#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:07,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {18022#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:07,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {18023#(<= main_~i~0 9)} assume true; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:07,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {18023#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:07,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {18023#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:07,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {18023#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:07,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {18024#(<= main_~i~0 10)} assume true; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:07,897 INFO L273 TraceCheckUtils]: 47: Hoare triple {18024#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:07,898 INFO L273 TraceCheckUtils]: 48: Hoare triple {18024#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:07,899 INFO L273 TraceCheckUtils]: 49: Hoare triple {18024#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:07,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {18025#(<= main_~i~0 11)} assume true; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:07,900 INFO L273 TraceCheckUtils]: 51: Hoare triple {18025#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:07,900 INFO L273 TraceCheckUtils]: 52: Hoare triple {18025#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:07,901 INFO L273 TraceCheckUtils]: 53: Hoare triple {18025#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:07,901 INFO L273 TraceCheckUtils]: 54: Hoare triple {18026#(<= main_~i~0 12)} assume true; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:07,902 INFO L273 TraceCheckUtils]: 55: Hoare triple {18026#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:07,902 INFO L273 TraceCheckUtils]: 56: Hoare triple {18026#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:07,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {18026#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:07,904 INFO L273 TraceCheckUtils]: 58: Hoare triple {18027#(<= main_~i~0 13)} assume true; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:07,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {18027#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:07,905 INFO L273 TraceCheckUtils]: 60: Hoare triple {18027#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:07,905 INFO L273 TraceCheckUtils]: 61: Hoare triple {18027#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:07,906 INFO L273 TraceCheckUtils]: 62: Hoare triple {18028#(<= main_~i~0 14)} assume true; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:07,906 INFO L273 TraceCheckUtils]: 63: Hoare triple {18028#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:07,907 INFO L273 TraceCheckUtils]: 64: Hoare triple {18028#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:07,908 INFO L273 TraceCheckUtils]: 65: Hoare triple {18028#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:07,908 INFO L273 TraceCheckUtils]: 66: Hoare triple {18029#(<= main_~i~0 15)} assume true; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:07,909 INFO L273 TraceCheckUtils]: 67: Hoare triple {18029#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:07,909 INFO L273 TraceCheckUtils]: 68: Hoare triple {18029#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:07,910 INFO L273 TraceCheckUtils]: 69: Hoare triple {18029#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:07,910 INFO L273 TraceCheckUtils]: 70: Hoare triple {18030#(<= main_~i~0 16)} assume true; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:07,911 INFO L273 TraceCheckUtils]: 71: Hoare triple {18030#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:07,911 INFO L273 TraceCheckUtils]: 72: Hoare triple {18030#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:07,912 INFO L273 TraceCheckUtils]: 73: Hoare triple {18030#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:07,913 INFO L273 TraceCheckUtils]: 74: Hoare triple {18031#(<= main_~i~0 17)} assume true; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:07,913 INFO L273 TraceCheckUtils]: 75: Hoare triple {18031#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:07,913 INFO L273 TraceCheckUtils]: 76: Hoare triple {18031#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:07,914 INFO L273 TraceCheckUtils]: 77: Hoare triple {18031#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:07,915 INFO L273 TraceCheckUtils]: 78: Hoare triple {18032#(<= main_~i~0 18)} assume true; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:07,915 INFO L273 TraceCheckUtils]: 79: Hoare triple {18032#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:07,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {18032#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:07,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {18032#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:07,917 INFO L273 TraceCheckUtils]: 82: Hoare triple {18033#(<= main_~i~0 19)} assume true; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:07,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {18033#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:07,918 INFO L273 TraceCheckUtils]: 84: Hoare triple {18033#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:07,918 INFO L273 TraceCheckUtils]: 85: Hoare triple {18033#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:07,919 INFO L273 TraceCheckUtils]: 86: Hoare triple {18034#(<= main_~i~0 20)} assume true; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:07,919 INFO L273 TraceCheckUtils]: 87: Hoare triple {18034#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:07,920 INFO L273 TraceCheckUtils]: 88: Hoare triple {18034#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:07,921 INFO L273 TraceCheckUtils]: 89: Hoare triple {18034#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:07,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {18035#(<= main_~i~0 21)} assume true; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:07,922 INFO L273 TraceCheckUtils]: 91: Hoare triple {18035#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:07,922 INFO L273 TraceCheckUtils]: 92: Hoare triple {18035#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:07,923 INFO L273 TraceCheckUtils]: 93: Hoare triple {18035#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:07,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {18036#(<= main_~i~0 22)} assume true; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:07,924 INFO L273 TraceCheckUtils]: 95: Hoare triple {18036#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:07,924 INFO L273 TraceCheckUtils]: 96: Hoare triple {18036#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:07,925 INFO L273 TraceCheckUtils]: 97: Hoare triple {18036#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:07,925 INFO L273 TraceCheckUtils]: 98: Hoare triple {18037#(<= main_~i~0 23)} assume true; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:07,926 INFO L273 TraceCheckUtils]: 99: Hoare triple {18037#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:07,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {18037#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:07,927 INFO L273 TraceCheckUtils]: 101: Hoare triple {18037#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:07,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {18038#(<= main_~i~0 24)} assume true; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:07,928 INFO L273 TraceCheckUtils]: 103: Hoare triple {18038#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:07,928 INFO L273 TraceCheckUtils]: 104: Hoare triple {18038#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:07,929 INFO L273 TraceCheckUtils]: 105: Hoare triple {18038#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:07,930 INFO L273 TraceCheckUtils]: 106: Hoare triple {18039#(<= main_~i~0 25)} assume true; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:07,930 INFO L273 TraceCheckUtils]: 107: Hoare triple {18039#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:07,931 INFO L273 TraceCheckUtils]: 108: Hoare triple {18039#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:07,931 INFO L273 TraceCheckUtils]: 109: Hoare triple {18039#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:07,932 INFO L273 TraceCheckUtils]: 110: Hoare triple {18040#(<= main_~i~0 26)} assume true; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:07,932 INFO L273 TraceCheckUtils]: 111: Hoare triple {18040#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:07,933 INFO L273 TraceCheckUtils]: 112: Hoare triple {18040#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:07,934 INFO L273 TraceCheckUtils]: 113: Hoare triple {18040#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:07,934 INFO L273 TraceCheckUtils]: 114: Hoare triple {18041#(<= main_~i~0 27)} assume true; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:07,935 INFO L273 TraceCheckUtils]: 115: Hoare triple {18041#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:07,935 INFO L273 TraceCheckUtils]: 116: Hoare triple {18041#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:07,936 INFO L273 TraceCheckUtils]: 117: Hoare triple {18041#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18042#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:07,936 INFO L273 TraceCheckUtils]: 118: Hoare triple {18042#(<= main_~i~0 28)} assume true; {18042#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:07,937 INFO L273 TraceCheckUtils]: 119: Hoare triple {18042#(<= main_~i~0 28)} assume !(~i~0 < 100000); {18013#false} is VALID [2018-11-14 16:58:07,937 INFO L273 TraceCheckUtils]: 120: Hoare triple {18013#false} havoc ~x~0;~x~0 := 0; {18013#false} is VALID [2018-11-14 16:58:07,937 INFO L273 TraceCheckUtils]: 121: Hoare triple {18013#false} assume true; {18013#false} is VALID [2018-11-14 16:58:07,937 INFO L273 TraceCheckUtils]: 122: Hoare triple {18013#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {18013#false} is VALID [2018-11-14 16:58:07,938 INFO L256 TraceCheckUtils]: 123: Hoare triple {18013#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18013#false} is VALID [2018-11-14 16:58:07,938 INFO L273 TraceCheckUtils]: 124: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2018-11-14 16:58:07,938 INFO L273 TraceCheckUtils]: 125: Hoare triple {18013#false} assume ~cond == 0; {18013#false} is VALID [2018-11-14 16:58:07,938 INFO L273 TraceCheckUtils]: 126: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2018-11-14 16:58:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:07,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:07,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:07,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:58:09,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:58:09,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:09,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:09,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2018-11-14 16:58:09,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18012#true} is VALID [2018-11-14 16:58:09,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2018-11-14 16:58:09,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #73#return; {18012#true} is VALID [2018-11-14 16:58:09,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret7 := main(); {18012#true} is VALID [2018-11-14 16:58:09,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {18012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18061#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:09,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {18061#(<= main_~i~0 0)} assume true; {18061#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:09,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {18061#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18061#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:09,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {18061#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18061#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:09,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {18061#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:09,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {18015#(<= main_~i~0 1)} assume true; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:09,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {18015#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:09,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {18015#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18015#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:09,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {18015#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:09,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {18016#(<= main_~i~0 2)} assume true; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:09,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {18016#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:09,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {18016#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18016#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:10,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {18016#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:10,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {18017#(<= main_~i~0 3)} assume true; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:10,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {18017#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:10,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {18017#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18017#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:10,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {18017#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:10,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {18018#(<= main_~i~0 4)} assume true; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:10,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {18018#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:10,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {18018#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18018#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:10,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {18018#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:10,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {18019#(<= main_~i~0 5)} assume true; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:10,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {18019#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:10,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {18019#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18019#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:10,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {18019#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:10,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {18020#(<= main_~i~0 6)} assume true; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:10,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {18020#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:10,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {18020#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18020#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:10,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {18020#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:10,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {18021#(<= main_~i~0 7)} assume true; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:10,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {18021#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:10,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {18021#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18021#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:10,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {18021#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:10,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {18022#(<= main_~i~0 8)} assume true; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:10,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {18022#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:10,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {18022#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18022#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:10,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {18022#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:10,013 INFO L273 TraceCheckUtils]: 42: Hoare triple {18023#(<= main_~i~0 9)} assume true; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:10,013 INFO L273 TraceCheckUtils]: 43: Hoare triple {18023#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:10,014 INFO L273 TraceCheckUtils]: 44: Hoare triple {18023#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18023#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:10,014 INFO L273 TraceCheckUtils]: 45: Hoare triple {18023#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:10,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {18024#(<= main_~i~0 10)} assume true; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:10,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {18024#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:10,016 INFO L273 TraceCheckUtils]: 48: Hoare triple {18024#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18024#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:10,016 INFO L273 TraceCheckUtils]: 49: Hoare triple {18024#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:10,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {18025#(<= main_~i~0 11)} assume true; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:10,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {18025#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:10,018 INFO L273 TraceCheckUtils]: 52: Hoare triple {18025#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18025#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:10,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {18025#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:10,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {18026#(<= main_~i~0 12)} assume true; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:10,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {18026#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:10,020 INFO L273 TraceCheckUtils]: 56: Hoare triple {18026#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18026#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:10,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {18026#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:10,021 INFO L273 TraceCheckUtils]: 58: Hoare triple {18027#(<= main_~i~0 13)} assume true; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:10,022 INFO L273 TraceCheckUtils]: 59: Hoare triple {18027#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:10,022 INFO L273 TraceCheckUtils]: 60: Hoare triple {18027#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18027#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:10,023 INFO L273 TraceCheckUtils]: 61: Hoare triple {18027#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:10,023 INFO L273 TraceCheckUtils]: 62: Hoare triple {18028#(<= main_~i~0 14)} assume true; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:10,024 INFO L273 TraceCheckUtils]: 63: Hoare triple {18028#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:10,024 INFO L273 TraceCheckUtils]: 64: Hoare triple {18028#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18028#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:10,025 INFO L273 TraceCheckUtils]: 65: Hoare triple {18028#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:10,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {18029#(<= main_~i~0 15)} assume true; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:10,026 INFO L273 TraceCheckUtils]: 67: Hoare triple {18029#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:10,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {18029#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18029#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:10,027 INFO L273 TraceCheckUtils]: 69: Hoare triple {18029#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:10,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {18030#(<= main_~i~0 16)} assume true; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:10,028 INFO L273 TraceCheckUtils]: 71: Hoare triple {18030#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:10,028 INFO L273 TraceCheckUtils]: 72: Hoare triple {18030#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18030#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:10,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {18030#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:10,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {18031#(<= main_~i~0 17)} assume true; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:10,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {18031#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:10,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {18031#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18031#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:10,031 INFO L273 TraceCheckUtils]: 77: Hoare triple {18031#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:10,032 INFO L273 TraceCheckUtils]: 78: Hoare triple {18032#(<= main_~i~0 18)} assume true; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:10,032 INFO L273 TraceCheckUtils]: 79: Hoare triple {18032#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:10,032 INFO L273 TraceCheckUtils]: 80: Hoare triple {18032#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18032#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:10,033 INFO L273 TraceCheckUtils]: 81: Hoare triple {18032#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:10,034 INFO L273 TraceCheckUtils]: 82: Hoare triple {18033#(<= main_~i~0 19)} assume true; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:10,034 INFO L273 TraceCheckUtils]: 83: Hoare triple {18033#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:10,035 INFO L273 TraceCheckUtils]: 84: Hoare triple {18033#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18033#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:10,035 INFO L273 TraceCheckUtils]: 85: Hoare triple {18033#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:10,036 INFO L273 TraceCheckUtils]: 86: Hoare triple {18034#(<= main_~i~0 20)} assume true; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:10,036 INFO L273 TraceCheckUtils]: 87: Hoare triple {18034#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:10,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {18034#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18034#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:10,037 INFO L273 TraceCheckUtils]: 89: Hoare triple {18034#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:10,038 INFO L273 TraceCheckUtils]: 90: Hoare triple {18035#(<= main_~i~0 21)} assume true; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:10,038 INFO L273 TraceCheckUtils]: 91: Hoare triple {18035#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:10,039 INFO L273 TraceCheckUtils]: 92: Hoare triple {18035#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18035#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:10,039 INFO L273 TraceCheckUtils]: 93: Hoare triple {18035#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:10,040 INFO L273 TraceCheckUtils]: 94: Hoare triple {18036#(<= main_~i~0 22)} assume true; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:10,040 INFO L273 TraceCheckUtils]: 95: Hoare triple {18036#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:10,041 INFO L273 TraceCheckUtils]: 96: Hoare triple {18036#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18036#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:10,042 INFO L273 TraceCheckUtils]: 97: Hoare triple {18036#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:10,042 INFO L273 TraceCheckUtils]: 98: Hoare triple {18037#(<= main_~i~0 23)} assume true; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:10,042 INFO L273 TraceCheckUtils]: 99: Hoare triple {18037#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:10,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {18037#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18037#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:10,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {18037#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:10,044 INFO L273 TraceCheckUtils]: 102: Hoare triple {18038#(<= main_~i~0 24)} assume true; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:10,045 INFO L273 TraceCheckUtils]: 103: Hoare triple {18038#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:10,045 INFO L273 TraceCheckUtils]: 104: Hoare triple {18038#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18038#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:10,046 INFO L273 TraceCheckUtils]: 105: Hoare triple {18038#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:10,046 INFO L273 TraceCheckUtils]: 106: Hoare triple {18039#(<= main_~i~0 25)} assume true; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:10,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {18039#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:10,047 INFO L273 TraceCheckUtils]: 108: Hoare triple {18039#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18039#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:10,048 INFO L273 TraceCheckUtils]: 109: Hoare triple {18039#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:10,048 INFO L273 TraceCheckUtils]: 110: Hoare triple {18040#(<= main_~i~0 26)} assume true; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:10,049 INFO L273 TraceCheckUtils]: 111: Hoare triple {18040#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:10,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {18040#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18040#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:10,082 INFO L273 TraceCheckUtils]: 113: Hoare triple {18040#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:10,090 INFO L273 TraceCheckUtils]: 114: Hoare triple {18041#(<= main_~i~0 27)} assume true; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:10,096 INFO L273 TraceCheckUtils]: 115: Hoare triple {18041#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:10,096 INFO L273 TraceCheckUtils]: 116: Hoare triple {18041#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {18041#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:10,097 INFO L273 TraceCheckUtils]: 117: Hoare triple {18041#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {18042#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:10,097 INFO L273 TraceCheckUtils]: 118: Hoare triple {18042#(<= main_~i~0 28)} assume true; {18042#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:10,097 INFO L273 TraceCheckUtils]: 119: Hoare triple {18042#(<= main_~i~0 28)} assume !(~i~0 < 100000); {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 120: Hoare triple {18013#false} havoc ~x~0;~x~0 := 0; {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 121: Hoare triple {18013#false} assume true; {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 122: Hoare triple {18013#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L256 TraceCheckUtils]: 123: Hoare triple {18013#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 124: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 125: Hoare triple {18013#false} assume ~cond == 0; {18013#false} is VALID [2018-11-14 16:58:10,098 INFO L273 TraceCheckUtils]: 126: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2018-11-14 16:58:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:10,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 16:58:10,131 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-14 16:58:10,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:10,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 16:58:10,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:10,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 16:58:10,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 16:58:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:58:10,260 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand 32 states. [2018-11-14 16:58:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:11,064 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2018-11-14 16:58:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 16:58:11,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-14 16:58:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:58:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 198 transitions. [2018-11-14 16:58:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:58:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 198 transitions. [2018-11-14 16:58:11,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 198 transitions. [2018-11-14 16:58:11,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:11,242 INFO L225 Difference]: With dead ends: 162 [2018-11-14 16:58:11,242 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 16:58:11,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:58:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 16:58:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-11-14 16:58:11,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:11,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2018-11-14 16:58:11,304 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2018-11-14 16:58:11,304 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2018-11-14 16:58:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:11,307 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-14 16:58:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-14 16:58:11,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:11,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:11,308 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2018-11-14 16:58:11,308 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2018-11-14 16:58:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:11,310 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-14 16:58:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-14 16:58:11,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:11,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:11,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:11,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-14 16:58:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2018-11-14 16:58:11,314 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 127 [2018-11-14 16:58:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2018-11-14 16:58:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 16:58:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-14 16:58:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-14 16:58:11,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:11,315 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:11,316 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:11,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1992066285, now seen corresponding path program 29 times [2018-11-14 16:58:11,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:11,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:11,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {19099#true} call ULTIMATE.init(); {19099#true} is VALID [2018-11-14 16:58:11,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {19099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19099#true} is VALID [2018-11-14 16:58:11,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {19099#true} assume true; {19099#true} is VALID [2018-11-14 16:58:11,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19099#true} {19099#true} #73#return; {19099#true} is VALID [2018-11-14 16:58:11,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {19099#true} call #t~ret7 := main(); {19099#true} is VALID [2018-11-14 16:58:11,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {19099#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19101#(= main_~i~0 0)} is VALID [2018-11-14 16:58:11,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {19101#(= main_~i~0 0)} assume true; {19101#(= main_~i~0 0)} is VALID [2018-11-14 16:58:11,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {19101#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19101#(= main_~i~0 0)} is VALID [2018-11-14 16:58:11,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {19101#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19101#(= main_~i~0 0)} is VALID [2018-11-14 16:58:11,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {19101#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:11,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {19102#(<= main_~i~0 1)} assume true; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:11,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {19102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:11,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {19102#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:11,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {19102#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:11,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {19103#(<= main_~i~0 2)} assume true; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:11,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {19103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:11,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {19103#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:11,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {19103#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:11,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {19104#(<= main_~i~0 3)} assume true; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:11,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {19104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:11,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {19104#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:11,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {19104#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:11,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {19105#(<= main_~i~0 4)} assume true; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:11,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {19105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:11,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {19105#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:11,967 INFO L273 TraceCheckUtils]: 25: Hoare triple {19105#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:11,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {19106#(<= main_~i~0 5)} assume true; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:11,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {19106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:11,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {19106#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:11,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {19106#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:11,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {19107#(<= main_~i~0 6)} assume true; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:11,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {19107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:11,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {19107#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:11,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {19107#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:11,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {19108#(<= main_~i~0 7)} assume true; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:11,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {19108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:11,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {19108#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:11,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {19108#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:11,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {19109#(<= main_~i~0 8)} assume true; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:11,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {19109#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:11,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {19109#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:11,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {19109#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:11,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {19110#(<= main_~i~0 9)} assume true; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:11,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {19110#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:11,977 INFO L273 TraceCheckUtils]: 44: Hoare triple {19110#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:11,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {19110#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:11,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {19111#(<= main_~i~0 10)} assume true; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:11,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {19111#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:11,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {19111#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:11,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {19111#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:11,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {19112#(<= main_~i~0 11)} assume true; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:11,980 INFO L273 TraceCheckUtils]: 51: Hoare triple {19112#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:11,981 INFO L273 TraceCheckUtils]: 52: Hoare triple {19112#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:11,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {19112#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:11,982 INFO L273 TraceCheckUtils]: 54: Hoare triple {19113#(<= main_~i~0 12)} assume true; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:11,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {19113#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:11,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {19113#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:11,984 INFO L273 TraceCheckUtils]: 57: Hoare triple {19113#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:11,984 INFO L273 TraceCheckUtils]: 58: Hoare triple {19114#(<= main_~i~0 13)} assume true; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:11,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {19114#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:11,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {19114#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:11,986 INFO L273 TraceCheckUtils]: 61: Hoare triple {19114#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:11,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {19115#(<= main_~i~0 14)} assume true; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:11,987 INFO L273 TraceCheckUtils]: 63: Hoare triple {19115#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:11,987 INFO L273 TraceCheckUtils]: 64: Hoare triple {19115#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:11,988 INFO L273 TraceCheckUtils]: 65: Hoare triple {19115#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:11,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {19116#(<= main_~i~0 15)} assume true; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:11,989 INFO L273 TraceCheckUtils]: 67: Hoare triple {19116#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:11,989 INFO L273 TraceCheckUtils]: 68: Hoare triple {19116#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:11,990 INFO L273 TraceCheckUtils]: 69: Hoare triple {19116#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:11,990 INFO L273 TraceCheckUtils]: 70: Hoare triple {19117#(<= main_~i~0 16)} assume true; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:11,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {19117#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:11,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {19117#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:11,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {19117#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:11,992 INFO L273 TraceCheckUtils]: 74: Hoare triple {19118#(<= main_~i~0 17)} assume true; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:11,993 INFO L273 TraceCheckUtils]: 75: Hoare triple {19118#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:11,993 INFO L273 TraceCheckUtils]: 76: Hoare triple {19118#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:11,994 INFO L273 TraceCheckUtils]: 77: Hoare triple {19118#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:11,995 INFO L273 TraceCheckUtils]: 78: Hoare triple {19119#(<= main_~i~0 18)} assume true; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:11,995 INFO L273 TraceCheckUtils]: 79: Hoare triple {19119#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:11,995 INFO L273 TraceCheckUtils]: 80: Hoare triple {19119#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:11,996 INFO L273 TraceCheckUtils]: 81: Hoare triple {19119#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:11,997 INFO L273 TraceCheckUtils]: 82: Hoare triple {19120#(<= main_~i~0 19)} assume true; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:11,997 INFO L273 TraceCheckUtils]: 83: Hoare triple {19120#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:11,998 INFO L273 TraceCheckUtils]: 84: Hoare triple {19120#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:11,998 INFO L273 TraceCheckUtils]: 85: Hoare triple {19120#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:11,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {19121#(<= main_~i~0 20)} assume true; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:11,999 INFO L273 TraceCheckUtils]: 87: Hoare triple {19121#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:12,000 INFO L273 TraceCheckUtils]: 88: Hoare triple {19121#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:12,000 INFO L273 TraceCheckUtils]: 89: Hoare triple {19121#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:12,001 INFO L273 TraceCheckUtils]: 90: Hoare triple {19122#(<= main_~i~0 21)} assume true; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:12,001 INFO L273 TraceCheckUtils]: 91: Hoare triple {19122#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:12,002 INFO L273 TraceCheckUtils]: 92: Hoare triple {19122#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:12,002 INFO L273 TraceCheckUtils]: 93: Hoare triple {19122#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:12,003 INFO L273 TraceCheckUtils]: 94: Hoare triple {19123#(<= main_~i~0 22)} assume true; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:12,003 INFO L273 TraceCheckUtils]: 95: Hoare triple {19123#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:12,004 INFO L273 TraceCheckUtils]: 96: Hoare triple {19123#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:12,004 INFO L273 TraceCheckUtils]: 97: Hoare triple {19123#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:12,005 INFO L273 TraceCheckUtils]: 98: Hoare triple {19124#(<= main_~i~0 23)} assume true; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:12,005 INFO L273 TraceCheckUtils]: 99: Hoare triple {19124#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:12,006 INFO L273 TraceCheckUtils]: 100: Hoare triple {19124#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:12,007 INFO L273 TraceCheckUtils]: 101: Hoare triple {19124#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:12,007 INFO L273 TraceCheckUtils]: 102: Hoare triple {19125#(<= main_~i~0 24)} assume true; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:12,007 INFO L273 TraceCheckUtils]: 103: Hoare triple {19125#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:12,008 INFO L273 TraceCheckUtils]: 104: Hoare triple {19125#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:12,009 INFO L273 TraceCheckUtils]: 105: Hoare triple {19125#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:12,009 INFO L273 TraceCheckUtils]: 106: Hoare triple {19126#(<= main_~i~0 25)} assume true; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:12,010 INFO L273 TraceCheckUtils]: 107: Hoare triple {19126#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:12,010 INFO L273 TraceCheckUtils]: 108: Hoare triple {19126#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:12,011 INFO L273 TraceCheckUtils]: 109: Hoare triple {19126#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:12,011 INFO L273 TraceCheckUtils]: 110: Hoare triple {19127#(<= main_~i~0 26)} assume true; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:12,012 INFO L273 TraceCheckUtils]: 111: Hoare triple {19127#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:12,012 INFO L273 TraceCheckUtils]: 112: Hoare triple {19127#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:12,013 INFO L273 TraceCheckUtils]: 113: Hoare triple {19127#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:12,013 INFO L273 TraceCheckUtils]: 114: Hoare triple {19128#(<= main_~i~0 27)} assume true; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:12,014 INFO L273 TraceCheckUtils]: 115: Hoare triple {19128#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:12,035 INFO L273 TraceCheckUtils]: 116: Hoare triple {19128#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:12,045 INFO L273 TraceCheckUtils]: 117: Hoare triple {19128#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:12,046 INFO L273 TraceCheckUtils]: 118: Hoare triple {19129#(<= main_~i~0 28)} assume true; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:12,046 INFO L273 TraceCheckUtils]: 119: Hoare triple {19129#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:12,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {19129#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:12,047 INFO L273 TraceCheckUtils]: 121: Hoare triple {19129#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19130#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:12,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {19130#(<= main_~i~0 29)} assume true; {19130#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:12,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {19130#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19100#false} is VALID [2018-11-14 16:58:12,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {19100#false} havoc ~x~0;~x~0 := 0; {19100#false} is VALID [2018-11-14 16:58:12,048 INFO L273 TraceCheckUtils]: 125: Hoare triple {19100#false} assume true; {19100#false} is VALID [2018-11-14 16:58:12,048 INFO L273 TraceCheckUtils]: 126: Hoare triple {19100#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {19100#false} is VALID [2018-11-14 16:58:12,048 INFO L256 TraceCheckUtils]: 127: Hoare triple {19100#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19100#false} is VALID [2018-11-14 16:58:12,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {19100#false} ~cond := #in~cond; {19100#false} is VALID [2018-11-14 16:58:12,049 INFO L273 TraceCheckUtils]: 129: Hoare triple {19100#false} assume ~cond == 0; {19100#false} is VALID [2018-11-14 16:58:12,049 INFO L273 TraceCheckUtils]: 130: Hoare triple {19100#false} assume !false; {19100#false} is VALID [2018-11-14 16:58:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:12,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:12,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:12,068 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:58:12,798 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 16:58:12,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:58:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:12,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:58:13,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {19099#true} call ULTIMATE.init(); {19099#true} is VALID [2018-11-14 16:58:13,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {19099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19099#true} is VALID [2018-11-14 16:58:13,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {19099#true} assume true; {19099#true} is VALID [2018-11-14 16:58:13,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19099#true} {19099#true} #73#return; {19099#true} is VALID [2018-11-14 16:58:13,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {19099#true} call #t~ret7 := main(); {19099#true} is VALID [2018-11-14 16:58:13,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {19099#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19149#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:13,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {19149#(<= main_~i~0 0)} assume true; {19149#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:13,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {19149#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19149#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:13,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {19149#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19149#(<= main_~i~0 0)} is VALID [2018-11-14 16:58:13,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {19149#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:13,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {19102#(<= main_~i~0 1)} assume true; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:13,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {19102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:13,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {19102#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19102#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:13,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {19102#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:13,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {19103#(<= main_~i~0 2)} assume true; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:13,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {19103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:13,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {19103#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19103#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:13,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {19103#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:13,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {19104#(<= main_~i~0 3)} assume true; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:13,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {19104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:13,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {19104#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19104#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:13,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {19104#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:13,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {19105#(<= main_~i~0 4)} assume true; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:13,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {19105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:13,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {19105#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19105#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:13,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {19105#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:13,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {19106#(<= main_~i~0 5)} assume true; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:13,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {19106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:13,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {19106#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19106#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:13,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {19106#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:13,106 INFO L273 TraceCheckUtils]: 30: Hoare triple {19107#(<= main_~i~0 6)} assume true; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:13,106 INFO L273 TraceCheckUtils]: 31: Hoare triple {19107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:13,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {19107#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19107#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:13,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {19107#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:13,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {19108#(<= main_~i~0 7)} assume true; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:13,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {19108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:13,112 INFO L273 TraceCheckUtils]: 36: Hoare triple {19108#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19108#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:13,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {19108#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:13,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {19109#(<= main_~i~0 8)} assume true; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:13,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {19109#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:13,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {19109#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19109#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:13,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {19109#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:13,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {19110#(<= main_~i~0 9)} assume true; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:13,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {19110#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:13,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {19110#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19110#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:13,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {19110#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:13,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {19111#(<= main_~i~0 10)} assume true; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:13,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {19111#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:13,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {19111#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19111#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:13,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {19111#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:13,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {19112#(<= main_~i~0 11)} assume true; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:13,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {19112#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:13,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {19112#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19112#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:13,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {19112#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:13,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {19113#(<= main_~i~0 12)} assume true; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:13,121 INFO L273 TraceCheckUtils]: 55: Hoare triple {19113#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:13,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {19113#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19113#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:13,122 INFO L273 TraceCheckUtils]: 57: Hoare triple {19113#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:13,123 INFO L273 TraceCheckUtils]: 58: Hoare triple {19114#(<= main_~i~0 13)} assume true; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:13,123 INFO L273 TraceCheckUtils]: 59: Hoare triple {19114#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:13,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {19114#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19114#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:13,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {19114#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:13,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {19115#(<= main_~i~0 14)} assume true; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:13,126 INFO L273 TraceCheckUtils]: 63: Hoare triple {19115#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:13,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {19115#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19115#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:13,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {19115#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:13,127 INFO L273 TraceCheckUtils]: 66: Hoare triple {19116#(<= main_~i~0 15)} assume true; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:13,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {19116#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:13,128 INFO L273 TraceCheckUtils]: 68: Hoare triple {19116#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19116#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:13,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {19116#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:13,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {19117#(<= main_~i~0 16)} assume true; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:13,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {19117#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:13,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {19117#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19117#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:13,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {19117#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:13,132 INFO L273 TraceCheckUtils]: 74: Hoare triple {19118#(<= main_~i~0 17)} assume true; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:13,132 INFO L273 TraceCheckUtils]: 75: Hoare triple {19118#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:13,133 INFO L273 TraceCheckUtils]: 76: Hoare triple {19118#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19118#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:13,133 INFO L273 TraceCheckUtils]: 77: Hoare triple {19118#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:13,134 INFO L273 TraceCheckUtils]: 78: Hoare triple {19119#(<= main_~i~0 18)} assume true; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:13,134 INFO L273 TraceCheckUtils]: 79: Hoare triple {19119#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:13,135 INFO L273 TraceCheckUtils]: 80: Hoare triple {19119#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19119#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:13,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {19119#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:13,136 INFO L273 TraceCheckUtils]: 82: Hoare triple {19120#(<= main_~i~0 19)} assume true; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:13,137 INFO L273 TraceCheckUtils]: 83: Hoare triple {19120#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:13,137 INFO L273 TraceCheckUtils]: 84: Hoare triple {19120#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19120#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:13,138 INFO L273 TraceCheckUtils]: 85: Hoare triple {19120#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:13,138 INFO L273 TraceCheckUtils]: 86: Hoare triple {19121#(<= main_~i~0 20)} assume true; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:13,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {19121#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:13,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {19121#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19121#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:13,140 INFO L273 TraceCheckUtils]: 89: Hoare triple {19121#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:13,141 INFO L273 TraceCheckUtils]: 90: Hoare triple {19122#(<= main_~i~0 21)} assume true; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:13,141 INFO L273 TraceCheckUtils]: 91: Hoare triple {19122#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:13,142 INFO L273 TraceCheckUtils]: 92: Hoare triple {19122#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19122#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:13,142 INFO L273 TraceCheckUtils]: 93: Hoare triple {19122#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:13,143 INFO L273 TraceCheckUtils]: 94: Hoare triple {19123#(<= main_~i~0 22)} assume true; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:13,143 INFO L273 TraceCheckUtils]: 95: Hoare triple {19123#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:13,144 INFO L273 TraceCheckUtils]: 96: Hoare triple {19123#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19123#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:13,145 INFO L273 TraceCheckUtils]: 97: Hoare triple {19123#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:13,145 INFO L273 TraceCheckUtils]: 98: Hoare triple {19124#(<= main_~i~0 23)} assume true; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:13,146 INFO L273 TraceCheckUtils]: 99: Hoare triple {19124#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:13,146 INFO L273 TraceCheckUtils]: 100: Hoare triple {19124#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19124#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:13,147 INFO L273 TraceCheckUtils]: 101: Hoare triple {19124#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:13,149 INFO L273 TraceCheckUtils]: 102: Hoare triple {19125#(<= main_~i~0 24)} assume true; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:13,150 INFO L273 TraceCheckUtils]: 103: Hoare triple {19125#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:13,150 INFO L273 TraceCheckUtils]: 104: Hoare triple {19125#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19125#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:13,151 INFO L273 TraceCheckUtils]: 105: Hoare triple {19125#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:13,151 INFO L273 TraceCheckUtils]: 106: Hoare triple {19126#(<= main_~i~0 25)} assume true; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:13,151 INFO L273 TraceCheckUtils]: 107: Hoare triple {19126#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:13,152 INFO L273 TraceCheckUtils]: 108: Hoare triple {19126#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19126#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:13,152 INFO L273 TraceCheckUtils]: 109: Hoare triple {19126#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:13,152 INFO L273 TraceCheckUtils]: 110: Hoare triple {19127#(<= main_~i~0 26)} assume true; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:13,153 INFO L273 TraceCheckUtils]: 111: Hoare triple {19127#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:13,153 INFO L273 TraceCheckUtils]: 112: Hoare triple {19127#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19127#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:13,154 INFO L273 TraceCheckUtils]: 113: Hoare triple {19127#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:13,155 INFO L273 TraceCheckUtils]: 114: Hoare triple {19128#(<= main_~i~0 27)} assume true; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:13,155 INFO L273 TraceCheckUtils]: 115: Hoare triple {19128#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:13,156 INFO L273 TraceCheckUtils]: 116: Hoare triple {19128#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19128#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:13,156 INFO L273 TraceCheckUtils]: 117: Hoare triple {19128#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:13,157 INFO L273 TraceCheckUtils]: 118: Hoare triple {19129#(<= main_~i~0 28)} assume true; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:13,157 INFO L273 TraceCheckUtils]: 119: Hoare triple {19129#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:13,158 INFO L273 TraceCheckUtils]: 120: Hoare triple {19129#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {19129#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:13,158 INFO L273 TraceCheckUtils]: 121: Hoare triple {19129#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {19130#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:13,159 INFO L273 TraceCheckUtils]: 122: Hoare triple {19130#(<= main_~i~0 29)} assume true; {19130#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:13,160 INFO L273 TraceCheckUtils]: 123: Hoare triple {19130#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19100#false} is VALID [2018-11-14 16:58:13,160 INFO L273 TraceCheckUtils]: 124: Hoare triple {19100#false} havoc ~x~0;~x~0 := 0; {19100#false} is VALID [2018-11-14 16:58:13,160 INFO L273 TraceCheckUtils]: 125: Hoare triple {19100#false} assume true; {19100#false} is VALID [2018-11-14 16:58:13,160 INFO L273 TraceCheckUtils]: 126: Hoare triple {19100#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {19100#false} is VALID [2018-11-14 16:58:13,160 INFO L256 TraceCheckUtils]: 127: Hoare triple {19100#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19100#false} is VALID [2018-11-14 16:58:13,161 INFO L273 TraceCheckUtils]: 128: Hoare triple {19100#false} ~cond := #in~cond; {19100#false} is VALID [2018-11-14 16:58:13,161 INFO L273 TraceCheckUtils]: 129: Hoare triple {19100#false} assume ~cond == 0; {19100#false} is VALID [2018-11-14 16:58:13,161 INFO L273 TraceCheckUtils]: 130: Hoare triple {19100#false} assume !false; {19100#false} is VALID [2018-11-14 16:58:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:13,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:58:13,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 16:58:13,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-14 16:58:13,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:58:13,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 16:58:13,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 16:58:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 16:58:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:58:13,324 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand 33 states. [2018-11-14 16:58:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:14,454 INFO L93 Difference]: Finished difference Result 166 states and 203 transitions. [2018-11-14 16:58:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 16:58:14,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-14 16:58:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:58:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:58:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 16:58:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:58:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 16:58:14,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 203 transitions. [2018-11-14 16:58:14,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:58:14,645 INFO L225 Difference]: With dead ends: 166 [2018-11-14 16:58:14,645 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 16:58:14,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:58:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 16:58:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-14 16:58:14,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:58:14,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-14 16:58:14,716 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-14 16:58:14,716 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-14 16:58:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:14,718 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2018-11-14 16:58:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2018-11-14 16:58:14,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:14,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:14,719 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-14 16:58:14,719 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-14 16:58:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:58:14,722 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2018-11-14 16:58:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2018-11-14 16:58:14,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:58:14,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:58:14,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:58:14,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:58:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 16:58:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2018-11-14 16:58:14,725 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 131 [2018-11-14 16:58:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:58:14,726 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2018-11-14 16:58:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 16:58:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-14 16:58:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-14 16:58:14,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:58:14,727 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:58:14,727 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:58:14,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:58:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1356531324, now seen corresponding path program 30 times [2018-11-14 16:58:14,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:58:14,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:58:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:14,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:58:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:58:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:58:17,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {20217#true} call ULTIMATE.init(); {20217#true} is VALID [2018-11-14 16:58:17,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {20217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20217#true} is VALID [2018-11-14 16:58:17,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {20217#true} assume true; {20217#true} is VALID [2018-11-14 16:58:17,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20217#true} {20217#true} #73#return; {20217#true} is VALID [2018-11-14 16:58:17,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {20217#true} call #t~ret7 := main(); {20217#true} is VALID [2018-11-14 16:58:17,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {20217#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {20219#(= main_~i~0 0)} is VALID [2018-11-14 16:58:17,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {20219#(= main_~i~0 0)} assume true; {20219#(= main_~i~0 0)} is VALID [2018-11-14 16:58:17,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {20219#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20219#(= main_~i~0 0)} is VALID [2018-11-14 16:58:17,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {20219#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20219#(= main_~i~0 0)} is VALID [2018-11-14 16:58:17,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {20219#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20220#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:17,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {20220#(<= main_~i~0 1)} assume true; {20220#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:17,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {20220#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20220#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:17,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {20220#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20220#(<= main_~i~0 1)} is VALID [2018-11-14 16:58:17,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {20220#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20221#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:17,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {20221#(<= main_~i~0 2)} assume true; {20221#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:17,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {20221#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20221#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:17,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {20221#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20221#(<= main_~i~0 2)} is VALID [2018-11-14 16:58:17,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {20221#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20222#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:17,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {20222#(<= main_~i~0 3)} assume true; {20222#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:17,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {20222#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20222#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:17,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {20222#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20222#(<= main_~i~0 3)} is VALID [2018-11-14 16:58:17,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {20222#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20223#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:17,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {20223#(<= main_~i~0 4)} assume true; {20223#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:17,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {20223#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20223#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:17,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {20223#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20223#(<= main_~i~0 4)} is VALID [2018-11-14 16:58:17,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {20223#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20224#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:17,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {20224#(<= main_~i~0 5)} assume true; {20224#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:17,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {20224#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20224#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:17,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {20224#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20224#(<= main_~i~0 5)} is VALID [2018-11-14 16:58:17,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {20224#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20225#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:17,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {20225#(<= main_~i~0 6)} assume true; {20225#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:17,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {20225#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20225#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:17,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {20225#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20225#(<= main_~i~0 6)} is VALID [2018-11-14 16:58:17,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {20225#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20226#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:17,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {20226#(<= main_~i~0 7)} assume true; {20226#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:17,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {20226#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20226#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:17,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {20226#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20226#(<= main_~i~0 7)} is VALID [2018-11-14 16:58:17,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {20226#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20227#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:17,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {20227#(<= main_~i~0 8)} assume true; {20227#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:17,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {20227#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20227#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:17,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {20227#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20227#(<= main_~i~0 8)} is VALID [2018-11-14 16:58:17,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {20227#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20228#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:17,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {20228#(<= main_~i~0 9)} assume true; {20228#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:17,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {20228#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20228#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:17,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {20228#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20228#(<= main_~i~0 9)} is VALID [2018-11-14 16:58:17,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {20228#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20229#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:17,162 INFO L273 TraceCheckUtils]: 46: Hoare triple {20229#(<= main_~i~0 10)} assume true; {20229#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:17,162 INFO L273 TraceCheckUtils]: 47: Hoare triple {20229#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20229#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:17,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {20229#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20229#(<= main_~i~0 10)} is VALID [2018-11-14 16:58:17,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {20229#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20230#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:17,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {20230#(<= main_~i~0 11)} assume true; {20230#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:17,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {20230#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20230#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:17,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {20230#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20230#(<= main_~i~0 11)} is VALID [2018-11-14 16:58:17,166 INFO L273 TraceCheckUtils]: 53: Hoare triple {20230#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20231#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:17,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {20231#(<= main_~i~0 12)} assume true; {20231#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:17,167 INFO L273 TraceCheckUtils]: 55: Hoare triple {20231#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20231#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:17,167 INFO L273 TraceCheckUtils]: 56: Hoare triple {20231#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20231#(<= main_~i~0 12)} is VALID [2018-11-14 16:58:17,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {20231#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20232#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:17,168 INFO L273 TraceCheckUtils]: 58: Hoare triple {20232#(<= main_~i~0 13)} assume true; {20232#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:17,169 INFO L273 TraceCheckUtils]: 59: Hoare triple {20232#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20232#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:17,169 INFO L273 TraceCheckUtils]: 60: Hoare triple {20232#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20232#(<= main_~i~0 13)} is VALID [2018-11-14 16:58:17,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {20232#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20233#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:17,171 INFO L273 TraceCheckUtils]: 62: Hoare triple {20233#(<= main_~i~0 14)} assume true; {20233#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:17,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {20233#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20233#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:17,172 INFO L273 TraceCheckUtils]: 64: Hoare triple {20233#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20233#(<= main_~i~0 14)} is VALID [2018-11-14 16:58:17,172 INFO L273 TraceCheckUtils]: 65: Hoare triple {20233#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20234#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:17,173 INFO L273 TraceCheckUtils]: 66: Hoare triple {20234#(<= main_~i~0 15)} assume true; {20234#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:17,173 INFO L273 TraceCheckUtils]: 67: Hoare triple {20234#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20234#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:17,174 INFO L273 TraceCheckUtils]: 68: Hoare triple {20234#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20234#(<= main_~i~0 15)} is VALID [2018-11-14 16:58:17,175 INFO L273 TraceCheckUtils]: 69: Hoare triple {20234#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20235#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:17,175 INFO L273 TraceCheckUtils]: 70: Hoare triple {20235#(<= main_~i~0 16)} assume true; {20235#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:17,176 INFO L273 TraceCheckUtils]: 71: Hoare triple {20235#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20235#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:17,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {20235#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20235#(<= main_~i~0 16)} is VALID [2018-11-14 16:58:17,177 INFO L273 TraceCheckUtils]: 73: Hoare triple {20235#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20236#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:17,177 INFO L273 TraceCheckUtils]: 74: Hoare triple {20236#(<= main_~i~0 17)} assume true; {20236#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:17,178 INFO L273 TraceCheckUtils]: 75: Hoare triple {20236#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20236#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:17,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {20236#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20236#(<= main_~i~0 17)} is VALID [2018-11-14 16:58:17,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {20236#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20237#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:17,180 INFO L273 TraceCheckUtils]: 78: Hoare triple {20237#(<= main_~i~0 18)} assume true; {20237#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:17,180 INFO L273 TraceCheckUtils]: 79: Hoare triple {20237#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20237#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:17,181 INFO L273 TraceCheckUtils]: 80: Hoare triple {20237#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20237#(<= main_~i~0 18)} is VALID [2018-11-14 16:58:17,181 INFO L273 TraceCheckUtils]: 81: Hoare triple {20237#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20238#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:17,182 INFO L273 TraceCheckUtils]: 82: Hoare triple {20238#(<= main_~i~0 19)} assume true; {20238#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:17,182 INFO L273 TraceCheckUtils]: 83: Hoare triple {20238#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20238#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:17,183 INFO L273 TraceCheckUtils]: 84: Hoare triple {20238#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20238#(<= main_~i~0 19)} is VALID [2018-11-14 16:58:17,184 INFO L273 TraceCheckUtils]: 85: Hoare triple {20238#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20239#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:17,184 INFO L273 TraceCheckUtils]: 86: Hoare triple {20239#(<= main_~i~0 20)} assume true; {20239#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:17,185 INFO L273 TraceCheckUtils]: 87: Hoare triple {20239#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20239#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:17,185 INFO L273 TraceCheckUtils]: 88: Hoare triple {20239#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20239#(<= main_~i~0 20)} is VALID [2018-11-14 16:58:17,186 INFO L273 TraceCheckUtils]: 89: Hoare triple {20239#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20240#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:17,187 INFO L273 TraceCheckUtils]: 90: Hoare triple {20240#(<= main_~i~0 21)} assume true; {20240#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:17,187 INFO L273 TraceCheckUtils]: 91: Hoare triple {20240#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20240#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:17,188 INFO L273 TraceCheckUtils]: 92: Hoare triple {20240#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20240#(<= main_~i~0 21)} is VALID [2018-11-14 16:58:17,188 INFO L273 TraceCheckUtils]: 93: Hoare triple {20240#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20241#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:17,189 INFO L273 TraceCheckUtils]: 94: Hoare triple {20241#(<= main_~i~0 22)} assume true; {20241#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:17,189 INFO L273 TraceCheckUtils]: 95: Hoare triple {20241#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20241#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:17,190 INFO L273 TraceCheckUtils]: 96: Hoare triple {20241#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20241#(<= main_~i~0 22)} is VALID [2018-11-14 16:58:17,191 INFO L273 TraceCheckUtils]: 97: Hoare triple {20241#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20242#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:17,191 INFO L273 TraceCheckUtils]: 98: Hoare triple {20242#(<= main_~i~0 23)} assume true; {20242#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:17,192 INFO L273 TraceCheckUtils]: 99: Hoare triple {20242#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20242#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:17,192 INFO L273 TraceCheckUtils]: 100: Hoare triple {20242#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20242#(<= main_~i~0 23)} is VALID [2018-11-14 16:58:17,193 INFO L273 TraceCheckUtils]: 101: Hoare triple {20242#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20243#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:17,193 INFO L273 TraceCheckUtils]: 102: Hoare triple {20243#(<= main_~i~0 24)} assume true; {20243#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:17,194 INFO L273 TraceCheckUtils]: 103: Hoare triple {20243#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20243#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:17,194 INFO L273 TraceCheckUtils]: 104: Hoare triple {20243#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20243#(<= main_~i~0 24)} is VALID [2018-11-14 16:58:17,195 INFO L273 TraceCheckUtils]: 105: Hoare triple {20243#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20244#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:17,196 INFO L273 TraceCheckUtils]: 106: Hoare triple {20244#(<= main_~i~0 25)} assume true; {20244#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:17,196 INFO L273 TraceCheckUtils]: 107: Hoare triple {20244#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20244#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:17,197 INFO L273 TraceCheckUtils]: 108: Hoare triple {20244#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20244#(<= main_~i~0 25)} is VALID [2018-11-14 16:58:17,197 INFO L273 TraceCheckUtils]: 109: Hoare triple {20244#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20245#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:17,198 INFO L273 TraceCheckUtils]: 110: Hoare triple {20245#(<= main_~i~0 26)} assume true; {20245#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:17,198 INFO L273 TraceCheckUtils]: 111: Hoare triple {20245#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20245#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:17,199 INFO L273 TraceCheckUtils]: 112: Hoare triple {20245#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20245#(<= main_~i~0 26)} is VALID [2018-11-14 16:58:17,200 INFO L273 TraceCheckUtils]: 113: Hoare triple {20245#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20246#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:17,200 INFO L273 TraceCheckUtils]: 114: Hoare triple {20246#(<= main_~i~0 27)} assume true; {20246#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:17,201 INFO L273 TraceCheckUtils]: 115: Hoare triple {20246#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20246#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:17,201 INFO L273 TraceCheckUtils]: 116: Hoare triple {20246#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20246#(<= main_~i~0 27)} is VALID [2018-11-14 16:58:17,202 INFO L273 TraceCheckUtils]: 117: Hoare triple {20246#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20247#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:17,202 INFO L273 TraceCheckUtils]: 118: Hoare triple {20247#(<= main_~i~0 28)} assume true; {20247#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:17,203 INFO L273 TraceCheckUtils]: 119: Hoare triple {20247#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20247#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:17,203 INFO L273 TraceCheckUtils]: 120: Hoare triple {20247#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20247#(<= main_~i~0 28)} is VALID [2018-11-14 16:58:17,204 INFO L273 TraceCheckUtils]: 121: Hoare triple {20247#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20248#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:17,205 INFO L273 TraceCheckUtils]: 122: Hoare triple {20248#(<= main_~i~0 29)} assume true; {20248#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:17,205 INFO L273 TraceCheckUtils]: 123: Hoare triple {20248#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * 4, 4); {20248#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:17,206 INFO L273 TraceCheckUtils]: 124: Hoare triple {20248#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem2;havoc #t~mem1;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {20248#(<= main_~i~0 29)} is VALID [2018-11-14 16:58:17,206 INFO L273 TraceCheckUtils]: 125: Hoare triple {20248#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {20249#(<= main_~i~0 30)} is VALID [2018-11-14 16:58:17,207 INFO L273 TraceCheckUtils]: 126: Hoare triple {20249#(<= main_~i~0 30)} assume true; {20249#(<= main_~i~0 30)} is VALID [2018-11-14 16:58:17,208 INFO L273 TraceCheckUtils]: 127: Hoare triple {20249#(<= main_~i~0 30)} assume !(~i~0 < 100000); {20218#false} is VALID [2018-11-14 16:58:17,208 INFO L273 TraceCheckUtils]: 128: Hoare triple {20218#false} havoc ~x~0;~x~0 := 0; {20218#false} is VALID [2018-11-14 16:58:17,208 INFO L273 TraceCheckUtils]: 129: Hoare triple {20218#false} assume true; {20218#false} is VALID [2018-11-14 16:58:17,208 INFO L273 TraceCheckUtils]: 130: Hoare triple {20218#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + ~x~0 * 4, 4); {20218#false} is VALID [2018-11-14 16:58:17,208 INFO L256 TraceCheckUtils]: 131: Hoare triple {20218#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {20218#false} is VALID [2018-11-14 16:58:17,209 INFO L273 TraceCheckUtils]: 132: Hoare triple {20218#false} ~cond := #in~cond; {20218#false} is VALID [2018-11-14 16:58:17,209 INFO L273 TraceCheckUtils]: 133: Hoare triple {20218#false} assume ~cond == 0; {20218#false} is VALID [2018-11-14 16:58:17,209 INFO L273 TraceCheckUtils]: 134: Hoare triple {20218#false} assume !false; {20218#false} is VALID [2018-11-14 16:58:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:58:17,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:58:17,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:58:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE