java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:36,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:36,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:37,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:37,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:37,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:37,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:37,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:37,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:37,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:37,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:37,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:37,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:37,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:37,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:37,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:37,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:37,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:37,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:37,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:37,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:37,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:37,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:37,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:37,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:37,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:37,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:37,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:37,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:37,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:37,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:37,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:37,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:37,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:37,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:37,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:37,065 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:23:37,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:37,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:37,090 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:37,090 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:37,091 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:37,091 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:37,091 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:37,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:37,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:37,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:37,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:37,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:37,096 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:37,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:37,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:37,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:37,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:37,097 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:37,097 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:37,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:37,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:37,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:37,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:37,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:37,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:37,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:37,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:37,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:37,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:37,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:37,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:37,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:37,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:37,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:37,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:37,189 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:37,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i [2018-11-23 12:23:37,260 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62d895b/8da8fcba48a54eaaaf49be480908c431/FLAG0bf2a99cf [2018-11-23 12:23:37,678 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:37,679 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i [2018-11-23 12:23:37,684 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62d895b/8da8fcba48a54eaaaf49be480908c431/FLAG0bf2a99cf [2018-11-23 12:23:38,049 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62d895b/8da8fcba48a54eaaaf49be480908c431 [2018-11-23 12:23:38,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:38,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:38,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:38,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:38,065 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:38,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38, skipping insertion in model container [2018-11-23 12:23:38,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:38,107 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:38,361 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:38,366 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:38,394 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:38,422 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:38,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38 WrapperNode [2018-11-23 12:23:38,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:38,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:38,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:38,424 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:38,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:38,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:38,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:38,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:38,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... [2018-11-23 12:23:38,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:38,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:38,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:38,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:38,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:38,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:23:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:23:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:39,273 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:39,274 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:23:39,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:39 BoogieIcfgContainer [2018-11-23 12:23:39,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:39,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:39,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:39,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:39,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:38" (1/3) ... [2018-11-23 12:23:39,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83eb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:39, skipping insertion in model container [2018-11-23 12:23:39,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:38" (2/3) ... [2018-11-23 12:23:39,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83eb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:39, skipping insertion in model container [2018-11-23 12:23:39,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:39" (3/3) ... [2018-11-23 12:23:39,282 INFO L112 eAbstractionObserver]: Analyzing ICFG copysome1_true-unreach-call.i [2018-11-23 12:23:39,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:39,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:39,320 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:39,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:39,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:39,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:39,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:39,367 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:39,367 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:39,367 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:39,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:39,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:23:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:23:39,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:39,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:39,394 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:39,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -908266250, now seen corresponding path program 1 times [2018-11-23 12:23:39,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:39,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:39,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:23:39,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:23:39,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:23:39,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #73#return; {32#true} is VALID [2018-11-23 12:23:39,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret8 := main(); {32#true} is VALID [2018-11-23 12:23:39,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {32#true} is VALID [2018-11-23 12:23:39,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:23:39,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:23:39,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 12:23:39,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 12:23:39,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!(~x~0 < 200000); {33#false} is VALID [2018-11-23 12:23:39,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:23:39,573 INFO L256 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {33#false} is VALID [2018-11-23 12:23:39,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:23:39,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:23:39,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:23:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:39,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:39,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:23:39,586 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:23:39,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:39,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:23:39,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:39,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:23:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:23:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:39,745 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:23:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,038 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 12:23:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:23:40,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:23:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:23:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:23:40,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 12:23:40,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:40,333 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:23:40,333 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:23:40,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:23:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:23:40,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:40,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:40,371 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:40,371 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,376 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:23:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:40,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:40,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:40,377 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:40,377 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,381 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:23:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:40,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:40,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:40,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:40,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:23:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:23:40,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2018-11-23 12:23:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:40,388 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:23:40,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:23:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:23:40,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:40,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:40,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:40,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1720229721, now seen corresponding path program 1 times [2018-11-23 12:23:40,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:40,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:40,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2018-11-23 12:23:40,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {180#true} is VALID [2018-11-23 12:23:40,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2018-11-23 12:23:40,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #73#return; {180#true} is VALID [2018-11-23 12:23:40,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret8 := main(); {180#true} is VALID [2018-11-23 12:23:40,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {180#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {182#(= main_~i~0 0)} is VALID [2018-11-23 12:23:40,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#(= main_~i~0 0)} assume !(~i~0 < 200000); {181#false} is VALID [2018-11-23 12:23:40,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#false} ~i~0 := 0; {181#false} is VALID [2018-11-23 12:23:40,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#false} assume !(~i~0 < 200000); {181#false} is VALID [2018-11-23 12:23:40,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#false} havoc ~x~0;~x~0 := 0; {181#false} is VALID [2018-11-23 12:23:40,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#false} assume !!(~x~0 < 200000); {181#false} is VALID [2018-11-23 12:23:40,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {181#false} is VALID [2018-11-23 12:23:40,522 INFO L256 TraceCheckUtils]: 12: Hoare triple {181#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {181#false} is VALID [2018-11-23 12:23:40,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2018-11-23 12:23:40,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2018-11-23 12:23:40,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2018-11-23 12:23:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:40,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:40,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:23:40,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:23:40,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:40,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:23:40,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:40,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:23:40,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:23:40,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:40,558 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 12:23:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,728 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 12:23:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:23:40,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:23:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:40,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:23:41,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:41,169 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:23:41,169 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:23:41,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:23:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-23 12:23:41,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:41,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:41,187 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:41,187 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:41,191 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:23:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:23:41,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:41,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:41,192 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2018-11-23 12:23:41,193 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2018-11-23 12:23:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:41,195 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:23:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:23:41,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:41,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:41,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:41,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:23:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:23:41,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-11-23 12:23:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:41,200 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:23:41,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:23:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:23:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:23:41,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:41,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:41,201 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:41,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2103920742, now seen corresponding path program 1 times [2018-11-23 12:23:41,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:41,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:41,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:41,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 12:23:41,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {340#true} is VALID [2018-11-23 12:23:41,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-23 12:23:41,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #73#return; {340#true} is VALID [2018-11-23 12:23:41,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret8 := main(); {340#true} is VALID [2018-11-23 12:23:41,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {342#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {342#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {342#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {342#(<= main_~z~0 150000)} ~i~0 := 0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {342#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {343#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:41,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {344#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:41,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {344#(<= main_~i~0 150001)} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:41,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} havoc ~x~0;~x~0 := 0; {341#false} is VALID [2018-11-23 12:23:41,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !!(~x~0 < 200000); {341#false} is VALID [2018-11-23 12:23:41,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {341#false} is VALID [2018-11-23 12:23:41,354 INFO L256 TraceCheckUtils]: 17: Hoare triple {341#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {341#false} is VALID [2018-11-23 12:23:41,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2018-11-23 12:23:41,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2018-11-23 12:23:41,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 12:23:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:23:41,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:41,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:41,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:41,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 12:23:41,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {340#true} is VALID [2018-11-23 12:23:41,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-23 12:23:41,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #73#return; {340#true} is VALID [2018-11-23 12:23:41,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret8 := main(); {340#true} is VALID [2018-11-23 12:23:42,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {363#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:42,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {363#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:42,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {370#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:42,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= main_~i~0 1)} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:42,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {341#false} ~i~0 := 0; {341#false} is VALID [2018-11-23 12:23:42,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {341#false} assume !!(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:42,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {341#false} assume !(~i~0 != ~z~0); {341#false} is VALID [2018-11-23 12:23:42,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {341#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {341#false} is VALID [2018-11-23 12:23:42,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {341#false} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:42,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} havoc ~x~0;~x~0 := 0; {341#false} is VALID [2018-11-23 12:23:42,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !!(~x~0 < 200000); {341#false} is VALID [2018-11-23 12:23:42,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {341#false} is VALID [2018-11-23 12:23:42,015 INFO L256 TraceCheckUtils]: 17: Hoare triple {341#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {341#false} is VALID [2018-11-23 12:23:42,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2018-11-23 12:23:42,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2018-11-23 12:23:42,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 12:23:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:23:42,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:42,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 12:23:42,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:23:42,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:42,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:23:42,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:42,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:23:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:23:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:23:42,124 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2018-11-23 12:23:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:42,877 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 12:23:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:23:42,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:23:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:23:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:23:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:23:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:23:42,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 12:23:43,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:43,071 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:23:43,071 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:23:43,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:23:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:23:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:23:43,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:43,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:43,137 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:43,137 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:43,142 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:23:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:23:43,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:43,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:43,143 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2018-11-23 12:23:43,143 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2018-11-23 12:23:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:43,147 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:23:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:23:43,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:43,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:43,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:43,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:23:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 12:23:43,151 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2018-11-23 12:23:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:43,151 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 12:23:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:23:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-23 12:23:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:23:43,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:43,153 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:43,154 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:43,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1242247089, now seen corresponding path program 1 times [2018-11-23 12:23:43,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:43,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-23 12:23:43,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {646#true} is VALID [2018-11-23 12:23:43,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-23 12:23:43,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #73#return; {646#true} is VALID [2018-11-23 12:23:43,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret8 := main(); {646#true} is VALID [2018-11-23 12:23:43,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {646#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {646#true} is VALID [2018-11-23 12:23:43,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:43,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:43,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:43,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:43,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:43,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:43,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:43,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:43,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {646#true} assume !(~i~0 < 200000); {646#true} is VALID [2018-11-23 12:23:43,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {646#true} ~i~0 := 0; {646#true} is VALID [2018-11-23 12:23:43,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {646#true} assume !!(~i~0 < 200000); {646#true} is VALID [2018-11-23 12:23:43,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {646#true} assume !(~i~0 != ~z~0); {648#(<= main_~z~0 main_~i~0)} is VALID [2018-11-23 12:23:43,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {648#(<= main_~z~0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {649#(<= (+ main_~z~0 1) main_~i~0)} is VALID [2018-11-23 12:23:43,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {649#(<= (+ main_~z~0 1) main_~i~0)} assume !!(~i~0 < 200000); {649#(<= (+ main_~z~0 1) main_~i~0)} is VALID [2018-11-23 12:23:43,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#(<= (+ main_~z~0 1) main_~i~0)} assume !(~i~0 != ~z~0); {647#false} is VALID [2018-11-23 12:23:43,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:43,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {647#false} assume !!(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:43,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {647#false} assume !(~i~0 != ~z~0); {647#false} is VALID [2018-11-23 12:23:43,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:43,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {647#false} assume !!(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:43,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {647#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {647#false} is VALID [2018-11-23 12:23:43,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:43,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {647#false} assume !(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:43,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {647#false} havoc ~x~0;~x~0 := 0; {647#false} is VALID [2018-11-23 12:23:43,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {647#false} assume !!(~x~0 < 200000); {647#false} is VALID [2018-11-23 12:23:43,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {647#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {647#false} is VALID [2018-11-23 12:23:43,301 INFO L256 TraceCheckUtils]: 32: Hoare triple {647#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {647#false} is VALID [2018-11-23 12:23:43,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {647#false} ~cond := #in~cond; {647#false} is VALID [2018-11-23 12:23:43,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {647#false} assume 0 == ~cond; {647#false} is VALID [2018-11-23 12:23:43,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-23 12:23:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:23:43,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:43,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:23:43,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 12:23:43,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:43,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:23:43,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:43,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:23:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:23:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:43,367 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 4 states. [2018-11-23 12:23:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:43,601 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2018-11-23 12:23:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:23:43,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 12:23:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:23:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:23:43,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:23:43,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:43,709 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:23:43,709 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:23:43,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:23:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-23 12:23:43,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-23 12:23:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-23 12:23:43,792 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-23 12:23:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:43,797 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 12:23:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-23 12:23:43,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:43,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:43,798 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-23 12:23:43,798 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-23 12:23:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:43,802 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 12:23:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-23 12:23:43,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:43,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:43,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:43,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:23:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 12:23:43,807 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 36 [2018-11-23 12:23:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:43,808 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 12:23:43,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:23:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 12:23:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:23:43,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:43,809 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:43,810 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:43,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1444845839, now seen corresponding path program 2 times [2018-11-23 12:23:43,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:44,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {954#true} call ULTIMATE.init(); {954#true} is VALID [2018-11-23 12:23:44,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {954#true} is VALID [2018-11-23 12:23:44,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-23 12:23:44,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} #73#return; {954#true} is VALID [2018-11-23 12:23:44,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {954#true} call #t~ret8 := main(); {954#true} is VALID [2018-11-23 12:23:44,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {954#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {956#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {956#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {956#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {956#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {956#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {956#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {956#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#(<= main_~z~0 150000)} ~i~0 := 0; {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {956#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:44,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {957#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:44,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {957#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {958#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:44,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {958#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {958#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:44,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {958#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {958#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:44,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {958#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {959#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:44,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {959#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {959#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:44,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {959#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {959#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:44,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {959#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {960#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:44,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {960#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {960#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:44,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {960#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:44,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {960#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {961#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:44,104 INFO L273 TraceCheckUtils]: 28: Hoare triple {961#(<= main_~i~0 150004)} assume !(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,105 INFO L273 TraceCheckUtils]: 29: Hoare triple {955#false} havoc ~x~0;~x~0 := 0; {955#false} is VALID [2018-11-23 12:23:44,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {955#false} assume !!(~x~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,106 INFO L273 TraceCheckUtils]: 31: Hoare triple {955#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {955#false} is VALID [2018-11-23 12:23:44,106 INFO L256 TraceCheckUtils]: 32: Hoare triple {955#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {955#false} is VALID [2018-11-23 12:23:44,106 INFO L273 TraceCheckUtils]: 33: Hoare triple {955#false} ~cond := #in~cond; {955#false} is VALID [2018-11-23 12:23:44,107 INFO L273 TraceCheckUtils]: 34: Hoare triple {955#false} assume 0 == ~cond; {955#false} is VALID [2018-11-23 12:23:44,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {955#false} assume !false; {955#false} is VALID [2018-11-23 12:23:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:23:44,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:44,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:23:44,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:23:44,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:44,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:44,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {954#true} call ULTIMATE.init(); {954#true} is VALID [2018-11-23 12:23:44,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {954#true} is VALID [2018-11-23 12:23:44,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-23 12:23:44,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} #73#return; {954#true} is VALID [2018-11-23 12:23:44,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {954#true} call #t~ret8 := main(); {954#true} is VALID [2018-11-23 12:23:44,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {954#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {980#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:44,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {980#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {980#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:44,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {987#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:44,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {987#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {987#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:44,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {987#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {994#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:44,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {994#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {994#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:44,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {994#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1001#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:44,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {1001#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1001#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:44,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {1001#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1008#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:44,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {1008#(<= main_~i~0 4)} assume !(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {955#false} ~i~0 := 0; {955#false} is VALID [2018-11-23 12:23:44,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {955#false} assume !!(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {955#false} assume !(~i~0 != ~z~0); {955#false} is VALID [2018-11-23 12:23:44,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {955#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {955#false} is VALID [2018-11-23 12:23:44,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {955#false} assume !!(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {955#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {955#false} is VALID [2018-11-23 12:23:44,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {955#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {955#false} is VALID [2018-11-23 12:23:44,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {955#false} assume !!(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {955#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {955#false} is VALID [2018-11-23 12:23:44,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {955#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {955#false} is VALID [2018-11-23 12:23:44,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {955#false} assume !!(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {955#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {955#false} is VALID [2018-11-23 12:23:44,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {955#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {955#false} is VALID [2018-11-23 12:23:44,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {955#false} assume !(~i~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {955#false} havoc ~x~0;~x~0 := 0; {955#false} is VALID [2018-11-23 12:23:44,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {955#false} assume !!(~x~0 < 200000); {955#false} is VALID [2018-11-23 12:23:44,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {955#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {955#false} is VALID [2018-11-23 12:23:44,513 INFO L256 TraceCheckUtils]: 32: Hoare triple {955#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {955#false} is VALID [2018-11-23 12:23:44,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {955#false} ~cond := #in~cond; {955#false} is VALID [2018-11-23 12:23:44,513 INFO L273 TraceCheckUtils]: 34: Hoare triple {955#false} assume 0 == ~cond; {955#false} is VALID [2018-11-23 12:23:44,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {955#false} assume !false; {955#false} is VALID [2018-11-23 12:23:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:23:44,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:44,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 12:23:44,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:23:44,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:44,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:23:44,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:44,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:23:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:23:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:23:44,593 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 13 states. [2018-11-23 12:23:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:45,516 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2018-11-23 12:23:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:23:45,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:23:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:23:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2018-11-23 12:23:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:23:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2018-11-23 12:23:45,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 119 transitions. [2018-11-23 12:23:45,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:45,811 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:23:45,812 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:23:45,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:23:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:23:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-11-23 12:23:45,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:45,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:45,921 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:45,921 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:45,926 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:23:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:23:45,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:45,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:45,928 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 111 states. [2018-11-23 12:23:45,928 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 111 states. [2018-11-23 12:23:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:45,933 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:23:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:23:45,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:45,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:45,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:45,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:23:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-11-23 12:23:45,939 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-11-23 12:23:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:45,939 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-11-23 12:23:45,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:23:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-11-23 12:23:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:23:45,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:45,942 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:45,942 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:45,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1575128733, now seen corresponding path program 3 times [2018-11-23 12:23:45,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:45,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:46,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-23 12:23:46,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1657#true} is VALID [2018-11-23 12:23:46,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:23:46,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #73#return; {1657#true} is VALID [2018-11-23 12:23:46,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret8 := main(); {1657#true} is VALID [2018-11-23 12:23:46,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {1659#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {1659#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {1659#(<= main_~z~0 150000)} ~i~0 := 0; {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {1659#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {1659#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:46,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {1659#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {1660#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:46,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {1660#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1661#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:46,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {1661#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {1661#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:46,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {1661#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1661#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:46,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {1661#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1662#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:46,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {1662#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {1662#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:46,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {1662#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1662#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:46,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {1662#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1663#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:46,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {1663#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {1663#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:46,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {1663#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1663#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:46,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {1663#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1664#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:46,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {1664#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {1664#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:46,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {1664#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1664#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:46,508 INFO L273 TraceCheckUtils]: 42: Hoare triple {1664#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1665#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:46,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {1665#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {1665#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:46,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {1665#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1665#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:46,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {1665#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1666#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:46,511 INFO L273 TraceCheckUtils]: 46: Hoare triple {1666#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {1666#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:46,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {1666#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1666#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:46,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {1666#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1667#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:46,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {1667#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {1667#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:46,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {1667#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1667#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:46,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {1667#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1668#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:46,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {1668#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {1668#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:46,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {1668#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1668#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:46,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {1668#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1669#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:46,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {1669#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {1669#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:46,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {1669#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1669#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:46,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {1669#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1670#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:46,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {1670#(<= main_~i~0 150010)} assume !(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {1658#false} havoc ~x~0;~x~0 := 0; {1658#false} is VALID [2018-11-23 12:23:46,526 INFO L273 TraceCheckUtils]: 60: Hoare triple {1658#false} assume !!(~x~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {1658#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1658#false} is VALID [2018-11-23 12:23:46,527 INFO L256 TraceCheckUtils]: 62: Hoare triple {1658#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1658#false} is VALID [2018-11-23 12:23:46,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {1658#false} ~cond := #in~cond; {1658#false} is VALID [2018-11-23 12:23:46,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {1658#false} assume 0 == ~cond; {1658#false} is VALID [2018-11-23 12:23:46,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-23 12:23:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:23:46,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:46,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:46,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:23:46,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:23:46,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:46,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:46,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-23 12:23:46,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1657#true} is VALID [2018-11-23 12:23:46,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:23:46,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #73#return; {1657#true} is VALID [2018-11-23 12:23:46,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret8 := main(); {1657#true} is VALID [2018-11-23 12:23:46,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {1689#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {1689#(<= 150000 main_~z~0)} assume !(~i~0 < 200000); {1689#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:46,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {1689#(<= 150000 main_~z~0)} ~i~0 := 0; {1756#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:46,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {1756#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !!(~i~0 < 200000); {1756#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:46,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {1756#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !(~i~0 != ~z~0); {1658#false} is VALID [2018-11-23 12:23:46,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,844 INFO L273 TraceCheckUtils]: 42: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,844 INFO L273 TraceCheckUtils]: 43: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,844 INFO L273 TraceCheckUtils]: 44: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,845 INFO L273 TraceCheckUtils]: 45: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,845 INFO L273 TraceCheckUtils]: 46: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,845 INFO L273 TraceCheckUtils]: 47: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,845 INFO L273 TraceCheckUtils]: 48: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,846 INFO L273 TraceCheckUtils]: 50: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {1658#false} assume !!(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {1658#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1658#false} is VALID [2018-11-23 12:23:46,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {1658#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1658#false} is VALID [2018-11-23 12:23:46,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {1658#false} assume !(~i~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {1658#false} havoc ~x~0;~x~0 := 0; {1658#false} is VALID [2018-11-23 12:23:46,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {1658#false} assume !!(~x~0 < 200000); {1658#false} is VALID [2018-11-23 12:23:46,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {1658#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1658#false} is VALID [2018-11-23 12:23:46,848 INFO L256 TraceCheckUtils]: 62: Hoare triple {1658#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1658#false} is VALID [2018-11-23 12:23:46,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {1658#false} ~cond := #in~cond; {1658#false} is VALID [2018-11-23 12:23:46,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {1658#false} assume 0 == ~cond; {1658#false} is VALID [2018-11-23 12:23:46,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-23 12:23:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 12:23:46,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2018-11-23 12:23:46,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-23 12:23:46,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:46,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:23:46,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:23:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:23:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:23:46,971 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 16 states. [2018-11-23 12:23:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:48,773 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2018-11-23 12:23:48,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:23:48,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-23 12:23:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2018-11-23 12:23:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2018-11-23 12:23:48,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 127 transitions. [2018-11-23 12:23:48,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:48,937 INFO L225 Difference]: With dead ends: 265 [2018-11-23 12:23:48,937 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 12:23:48,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:23:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 12:23:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 113. [2018-11-23 12:23:49,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:49,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:49,210 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:49,210 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:49,217 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-23 12:23:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-11-23 12:23:49,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:49,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:49,219 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 192 states. [2018-11-23 12:23:49,219 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 192 states. [2018-11-23 12:23:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:49,226 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-23 12:23:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-11-23 12:23:49,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:49,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:49,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:49,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:23:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2018-11-23 12:23:49,232 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 66 [2018-11-23 12:23:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:49,232 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2018-11-23 12:23:49,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:23:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2018-11-23 12:23:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:23:49,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:49,235 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:49,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:49,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1187837251, now seen corresponding path program 4 times [2018-11-23 12:23:49,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:49,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:49,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 12:23:49,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2796#true} is VALID [2018-11-23 12:23:49,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 12:23:49,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #73#return; {2796#true} is VALID [2018-11-23 12:23:49,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 12:23:49,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {2798#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {2798#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {2798#(<= main_~z~0 150000)} ~i~0 := 0; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {2798#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {2798#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {2798#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {2798#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:49,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {2798#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {2799#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:49,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {2799#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2800#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:49,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {2800#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {2800#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:49,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {2800#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2800#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:49,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {2800#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2801#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:49,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {2801#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {2801#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:49,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {2801#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2801#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:49,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {2801#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2802#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:49,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {2802#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {2802#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:49,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {2802#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2802#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:49,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {2802#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2803#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:49,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {2803#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {2803#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:49,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {2803#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2803#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:49,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {2803#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2804#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:49,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {2804#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {2804#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:49,560 INFO L273 TraceCheckUtils]: 51: Hoare triple {2804#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2804#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:49,560 INFO L273 TraceCheckUtils]: 52: Hoare triple {2804#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2805#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:49,561 INFO L273 TraceCheckUtils]: 53: Hoare triple {2805#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {2805#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:49,561 INFO L273 TraceCheckUtils]: 54: Hoare triple {2805#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2805#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:49,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {2805#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2806#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:49,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {2806#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {2806#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:49,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {2806#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2806#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:49,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {2806#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2807#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:49,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {2807#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {2807#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:49,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {2807#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2807#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:49,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {2807#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2808#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:49,567 INFO L273 TraceCheckUtils]: 62: Hoare triple {2808#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {2808#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:49,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {2808#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2808#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:49,570 INFO L273 TraceCheckUtils]: 64: Hoare triple {2808#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2809#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:49,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {2809#(<= main_~i~0 150010)} assume !!(~i~0 < 200000); {2809#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:49,571 INFO L273 TraceCheckUtils]: 66: Hoare triple {2809#(<= main_~i~0 150010)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2809#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:49,571 INFO L273 TraceCheckUtils]: 67: Hoare triple {2809#(<= main_~i~0 150010)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2810#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:49,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {2810#(<= main_~i~0 150011)} assume !(~i~0 < 200000); {2797#false} is VALID [2018-11-23 12:23:49,572 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0; {2797#false} is VALID [2018-11-23 12:23:49,572 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !!(~x~0 < 200000); {2797#false} is VALID [2018-11-23 12:23:49,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2797#false} is VALID [2018-11-23 12:23:49,573 INFO L256 TraceCheckUtils]: 72: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2797#false} is VALID [2018-11-23 12:23:49,573 INFO L273 TraceCheckUtils]: 73: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 12:23:49,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 12:23:49,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 12:23:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 12:23:49,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:49,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:49,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:23:49,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:23:49,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:49,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:50,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 12:23:50,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2796#true} is VALID [2018-11-23 12:23:50,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 12:23:50,143 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #73#return; {2796#true} is VALID [2018-11-23 12:23:50,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 12:23:50,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2796#true} is VALID [2018-11-23 12:23:50,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {2796#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2796#true} is VALID [2018-11-23 12:23:50,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2796#true} is VALID [2018-11-23 12:23:50,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {2796#true} assume !(~i~0 < 200000); {2796#true} is VALID [2018-11-23 12:23:50,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {2796#true} ~i~0 := 0; {2907#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:50,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {2907#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {2907#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:50,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {2907#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2907#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:50,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {2907#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2917#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:50,149 INFO L273 TraceCheckUtils]: 35: Hoare triple {2917#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {2917#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:50,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {2917#(<= main_~i~0 1)} assume !(~i~0 != ~z~0); {2917#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:50,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {2917#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2927#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:50,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {2927#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {2927#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:50,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {2927#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2927#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:50,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {2927#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2937#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:50,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {2937#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {2937#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:50,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {2937#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2937#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:50,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {2937#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2947#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:50,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {2947#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {2947#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:50,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {2947#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2947#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:50,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {2947#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2957#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:50,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {2957#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {2957#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:50,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {2957#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2957#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:50,157 INFO L273 TraceCheckUtils]: 49: Hoare triple {2957#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2967#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:50,157 INFO L273 TraceCheckUtils]: 50: Hoare triple {2967#(<= main_~i~0 6)} assume !!(~i~0 < 200000); {2967#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:50,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {2967#(<= main_~i~0 6)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2967#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:50,159 INFO L273 TraceCheckUtils]: 52: Hoare triple {2967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2977#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:50,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {2977#(<= main_~i~0 7)} assume !!(~i~0 < 200000); {2977#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:50,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {2977#(<= main_~i~0 7)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2977#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:50,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {2977#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:50,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {2987#(<= main_~i~0 8)} assume !!(~i~0 < 200000); {2987#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:50,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {2987#(<= main_~i~0 8)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2987#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:50,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {2987#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2997#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:50,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {2997#(<= main_~i~0 9)} assume !!(~i~0 < 200000); {2997#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:50,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {2997#(<= main_~i~0 9)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2997#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:50,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {2997#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3007#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:50,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {3007#(<= main_~i~0 10)} assume !!(~i~0 < 200000); {3007#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:50,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {3007#(<= main_~i~0 10)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3007#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:50,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {3007#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3017#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:50,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {3017#(<= main_~i~0 11)} assume !!(~i~0 < 200000); {3017#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:50,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {3017#(<= main_~i~0 11)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3017#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:50,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {3017#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3027#(<= main_~i~0 12)} is VALID [2018-11-23 12:23:50,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {3027#(<= main_~i~0 12)} assume !(~i~0 < 200000); {2797#false} is VALID [2018-11-23 12:23:50,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0; {2797#false} is VALID [2018-11-23 12:23:50,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !!(~x~0 < 200000); {2797#false} is VALID [2018-11-23 12:23:50,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2797#false} is VALID [2018-11-23 12:23:50,170 INFO L256 TraceCheckUtils]: 72: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2797#false} is VALID [2018-11-23 12:23:50,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 12:23:50,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 12:23:50,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 12:23:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:23:50,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:50,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 12:23:50,199 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-11-23 12:23:50,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:50,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:23:50,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:50,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:23:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:23:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:23:50,295 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand 28 states. [2018-11-23 12:23:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:53,439 INFO L93 Difference]: Finished difference Result 652 states and 734 transitions. [2018-11-23 12:23:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:23:53,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-11-23 12:23:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 222 transitions. [2018-11-23 12:23:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 222 transitions. [2018-11-23 12:23:53,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 222 transitions. [2018-11-23 12:23:53,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:53,778 INFO L225 Difference]: With dead ends: 652 [2018-11-23 12:23:53,778 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 12:23:53,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:23:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 12:23:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 217. [2018-11-23 12:23:54,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:54,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:54,833 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:54,833 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:54,858 INFO L93 Difference]: Finished difference Result 570 states and 599 transitions. [2018-11-23 12:23:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 599 transitions. [2018-11-23 12:23:54,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:54,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:54,860 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 570 states. [2018-11-23 12:23:54,860 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 570 states. [2018-11-23 12:23:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:54,886 INFO L93 Difference]: Finished difference Result 570 states and 599 transitions. [2018-11-23 12:23:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 599 transitions. [2018-11-23 12:23:54,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:54,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:54,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:54,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 12:23:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-11-23 12:23:54,896 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 76 [2018-11-23 12:23:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:54,896 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-11-23 12:23:54,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:23:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-11-23 12:23:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:23:54,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:54,898 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:54,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:54,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1035622098, now seen corresponding path program 5 times [2018-11-23 12:23:54,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:54,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:55,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2018-11-23 12:23:55,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {5448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5448#true} is VALID [2018-11-23 12:23:55,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2018-11-23 12:23:55,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #73#return; {5448#true} is VALID [2018-11-23 12:23:55,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret8 := main(); {5448#true} is VALID [2018-11-23 12:23:55,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {5448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,828 INFO L273 TraceCheckUtils]: 40: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,828 INFO L273 TraceCheckUtils]: 41: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,830 INFO L273 TraceCheckUtils]: 45: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,845 INFO L273 TraceCheckUtils]: 52: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,846 INFO L273 TraceCheckUtils]: 53: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,846 INFO L273 TraceCheckUtils]: 54: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,846 INFO L273 TraceCheckUtils]: 55: Hoare triple {5450#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {5450#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {5450#(<= main_~z~0 150000)} ~i~0 := 0; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,847 INFO L273 TraceCheckUtils]: 58: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {5450#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {5450#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,849 INFO L273 TraceCheckUtils]: 61: Hoare triple {5450#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {5450#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:55,849 INFO L273 TraceCheckUtils]: 62: Hoare triple {5450#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {5451#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:55,850 INFO L273 TraceCheckUtils]: 63: Hoare triple {5451#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5452#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:55,851 INFO L273 TraceCheckUtils]: 64: Hoare triple {5452#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {5452#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:55,851 INFO L273 TraceCheckUtils]: 65: Hoare triple {5452#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5452#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:55,852 INFO L273 TraceCheckUtils]: 66: Hoare triple {5452#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5453#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:55,853 INFO L273 TraceCheckUtils]: 67: Hoare triple {5453#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {5453#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:55,853 INFO L273 TraceCheckUtils]: 68: Hoare triple {5453#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5453#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:55,854 INFO L273 TraceCheckUtils]: 69: Hoare triple {5453#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5454#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:55,854 INFO L273 TraceCheckUtils]: 70: Hoare triple {5454#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {5454#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:55,855 INFO L273 TraceCheckUtils]: 71: Hoare triple {5454#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5454#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:55,856 INFO L273 TraceCheckUtils]: 72: Hoare triple {5454#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5455#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:55,856 INFO L273 TraceCheckUtils]: 73: Hoare triple {5455#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {5455#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:55,857 INFO L273 TraceCheckUtils]: 74: Hoare triple {5455#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5455#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:55,858 INFO L273 TraceCheckUtils]: 75: Hoare triple {5455#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5456#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:55,858 INFO L273 TraceCheckUtils]: 76: Hoare triple {5456#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {5456#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:55,859 INFO L273 TraceCheckUtils]: 77: Hoare triple {5456#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5456#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:55,859 INFO L273 TraceCheckUtils]: 78: Hoare triple {5456#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5457#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:55,860 INFO L273 TraceCheckUtils]: 79: Hoare triple {5457#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {5457#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:55,860 INFO L273 TraceCheckUtils]: 80: Hoare triple {5457#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5457#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:55,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {5457#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5458#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:55,862 INFO L273 TraceCheckUtils]: 82: Hoare triple {5458#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {5458#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:55,870 INFO L273 TraceCheckUtils]: 83: Hoare triple {5458#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5458#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:55,871 INFO L273 TraceCheckUtils]: 84: Hoare triple {5458#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5459#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:55,871 INFO L273 TraceCheckUtils]: 85: Hoare triple {5459#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {5459#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:55,872 INFO L273 TraceCheckUtils]: 86: Hoare triple {5459#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5459#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:55,872 INFO L273 TraceCheckUtils]: 87: Hoare triple {5459#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5460#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:55,873 INFO L273 TraceCheckUtils]: 88: Hoare triple {5460#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {5460#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:55,873 INFO L273 TraceCheckUtils]: 89: Hoare triple {5460#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5460#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:55,873 INFO L273 TraceCheckUtils]: 90: Hoare triple {5460#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5461#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:55,874 INFO L273 TraceCheckUtils]: 91: Hoare triple {5461#(<= main_~i~0 150010)} assume !!(~i~0 < 200000); {5461#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:55,874 INFO L273 TraceCheckUtils]: 92: Hoare triple {5461#(<= main_~i~0 150010)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5461#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:55,875 INFO L273 TraceCheckUtils]: 93: Hoare triple {5461#(<= main_~i~0 150010)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5462#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:55,875 INFO L273 TraceCheckUtils]: 94: Hoare triple {5462#(<= main_~i~0 150011)} assume !!(~i~0 < 200000); {5462#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:55,876 INFO L273 TraceCheckUtils]: 95: Hoare triple {5462#(<= main_~i~0 150011)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5462#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:55,877 INFO L273 TraceCheckUtils]: 96: Hoare triple {5462#(<= main_~i~0 150011)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5463#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:55,877 INFO L273 TraceCheckUtils]: 97: Hoare triple {5463#(<= main_~i~0 150012)} assume !!(~i~0 < 200000); {5463#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:55,878 INFO L273 TraceCheckUtils]: 98: Hoare triple {5463#(<= main_~i~0 150012)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5463#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:55,878 INFO L273 TraceCheckUtils]: 99: Hoare triple {5463#(<= main_~i~0 150012)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5464#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:55,879 INFO L273 TraceCheckUtils]: 100: Hoare triple {5464#(<= main_~i~0 150013)} assume !!(~i~0 < 200000); {5464#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:55,879 INFO L273 TraceCheckUtils]: 101: Hoare triple {5464#(<= main_~i~0 150013)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5464#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:55,880 INFO L273 TraceCheckUtils]: 102: Hoare triple {5464#(<= main_~i~0 150013)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5465#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:55,881 INFO L273 TraceCheckUtils]: 103: Hoare triple {5465#(<= main_~i~0 150014)} assume !!(~i~0 < 200000); {5465#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:55,881 INFO L273 TraceCheckUtils]: 104: Hoare triple {5465#(<= main_~i~0 150014)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5465#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:55,882 INFO L273 TraceCheckUtils]: 105: Hoare triple {5465#(<= main_~i~0 150014)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5466#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:55,882 INFO L273 TraceCheckUtils]: 106: Hoare triple {5466#(<= main_~i~0 150015)} assume !!(~i~0 < 200000); {5466#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:55,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {5466#(<= main_~i~0 150015)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5466#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:55,884 INFO L273 TraceCheckUtils]: 108: Hoare triple {5466#(<= main_~i~0 150015)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5467#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:55,884 INFO L273 TraceCheckUtils]: 109: Hoare triple {5467#(<= main_~i~0 150016)} assume !!(~i~0 < 200000); {5467#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:55,885 INFO L273 TraceCheckUtils]: 110: Hoare triple {5467#(<= main_~i~0 150016)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5467#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:55,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {5467#(<= main_~i~0 150016)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5468#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:55,886 INFO L273 TraceCheckUtils]: 112: Hoare triple {5468#(<= main_~i~0 150017)} assume !!(~i~0 < 200000); {5468#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:55,886 INFO L273 TraceCheckUtils]: 113: Hoare triple {5468#(<= main_~i~0 150017)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5468#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:55,887 INFO L273 TraceCheckUtils]: 114: Hoare triple {5468#(<= main_~i~0 150017)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5469#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:55,888 INFO L273 TraceCheckUtils]: 115: Hoare triple {5469#(<= main_~i~0 150018)} assume !!(~i~0 < 200000); {5469#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:55,888 INFO L273 TraceCheckUtils]: 116: Hoare triple {5469#(<= main_~i~0 150018)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5469#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:55,889 INFO L273 TraceCheckUtils]: 117: Hoare triple {5469#(<= main_~i~0 150018)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5470#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:55,889 INFO L273 TraceCheckUtils]: 118: Hoare triple {5470#(<= main_~i~0 150019)} assume !!(~i~0 < 200000); {5470#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:55,890 INFO L273 TraceCheckUtils]: 119: Hoare triple {5470#(<= main_~i~0 150019)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5470#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:55,891 INFO L273 TraceCheckUtils]: 120: Hoare triple {5470#(<= main_~i~0 150019)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5471#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:55,891 INFO L273 TraceCheckUtils]: 121: Hoare triple {5471#(<= main_~i~0 150020)} assume !!(~i~0 < 200000); {5471#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:55,892 INFO L273 TraceCheckUtils]: 122: Hoare triple {5471#(<= main_~i~0 150020)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5471#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:55,892 INFO L273 TraceCheckUtils]: 123: Hoare triple {5471#(<= main_~i~0 150020)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5472#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:55,893 INFO L273 TraceCheckUtils]: 124: Hoare triple {5472#(<= main_~i~0 150021)} assume !!(~i~0 < 200000); {5472#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:55,893 INFO L273 TraceCheckUtils]: 125: Hoare triple {5472#(<= main_~i~0 150021)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5472#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:55,894 INFO L273 TraceCheckUtils]: 126: Hoare triple {5472#(<= main_~i~0 150021)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5473#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:55,895 INFO L273 TraceCheckUtils]: 127: Hoare triple {5473#(<= main_~i~0 150022)} assume !!(~i~0 < 200000); {5473#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:55,895 INFO L273 TraceCheckUtils]: 128: Hoare triple {5473#(<= main_~i~0 150022)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5473#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:55,896 INFO L273 TraceCheckUtils]: 129: Hoare triple {5473#(<= main_~i~0 150022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5474#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:55,896 INFO L273 TraceCheckUtils]: 130: Hoare triple {5474#(<= main_~i~0 150023)} assume !!(~i~0 < 200000); {5474#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:55,897 INFO L273 TraceCheckUtils]: 131: Hoare triple {5474#(<= main_~i~0 150023)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5474#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:55,898 INFO L273 TraceCheckUtils]: 132: Hoare triple {5474#(<= main_~i~0 150023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5475#(<= main_~i~0 150024)} is VALID [2018-11-23 12:23:55,898 INFO L273 TraceCheckUtils]: 133: Hoare triple {5475#(<= main_~i~0 150024)} assume !(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:23:55,899 INFO L273 TraceCheckUtils]: 134: Hoare triple {5449#false} havoc ~x~0;~x~0 := 0; {5449#false} is VALID [2018-11-23 12:23:55,899 INFO L273 TraceCheckUtils]: 135: Hoare triple {5449#false} assume !!(~x~0 < 200000); {5449#false} is VALID [2018-11-23 12:23:55,899 INFO L273 TraceCheckUtils]: 136: Hoare triple {5449#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5449#false} is VALID [2018-11-23 12:23:55,899 INFO L256 TraceCheckUtils]: 137: Hoare triple {5449#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5449#false} is VALID [2018-11-23 12:23:55,899 INFO L273 TraceCheckUtils]: 138: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2018-11-23 12:23:55,900 INFO L273 TraceCheckUtils]: 139: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2018-11-23 12:23:55,900 INFO L273 TraceCheckUtils]: 140: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2018-11-23 12:23:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-11-23 12:23:55,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:55,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:12,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-11-23 12:27:12,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:12,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:13,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2018-11-23 12:27:13,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {5448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5448#true} is VALID [2018-11-23 12:27:13,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2018-11-23 12:27:13,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #73#return; {5448#true} is VALID [2018-11-23 12:27:13,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret8 := main(); {5448#true} is VALID [2018-11-23 12:27:13,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {5448#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,088 INFO L273 TraceCheckUtils]: 36: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,091 INFO L273 TraceCheckUtils]: 38: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,094 INFO L273 TraceCheckUtils]: 46: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {5494#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {5494#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,099 INFO L273 TraceCheckUtils]: 56: Hoare triple {5494#(<= 150000 main_~z~0)} assume !(~i~0 < 200000); {5494#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:13,100 INFO L273 TraceCheckUtils]: 57: Hoare triple {5494#(<= 150000 main_~z~0)} ~i~0 := 0; {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:13,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !!(~i~0 < 200000); {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:13,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:13,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {5651#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5661#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} is VALID [2018-11-23 12:27:13,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {5661#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} assume !!(~i~0 < 200000); {5661#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} is VALID [2018-11-23 12:27:13,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {5661#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} assume !(~i~0 != ~z~0); {5449#false} is VALID [2018-11-23 12:27:13,125 INFO L273 TraceCheckUtils]: 63: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 66: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 67: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 68: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 69: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,126 INFO L273 TraceCheckUtils]: 71: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 74: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 75: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 76: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 77: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 78: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,127 INFO L273 TraceCheckUtils]: 79: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 80: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 81: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 82: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 83: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 84: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 85: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 86: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,128 INFO L273 TraceCheckUtils]: 87: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 88: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 89: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 90: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 91: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 92: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 93: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 94: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,129 INFO L273 TraceCheckUtils]: 95: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 96: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 97: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 98: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 99: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 100: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 101: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 102: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 103: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,130 INFO L273 TraceCheckUtils]: 104: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 105: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 106: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 107: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 108: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 109: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 110: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 111: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,131 INFO L273 TraceCheckUtils]: 112: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 113: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 114: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 115: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 116: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 117: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 118: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 119: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,132 INFO L273 TraceCheckUtils]: 120: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 121: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 122: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 123: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 124: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 125: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 126: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 127: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,133 INFO L273 TraceCheckUtils]: 128: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 129: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 130: Hoare triple {5449#false} assume !!(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 131: Hoare triple {5449#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 132: Hoare triple {5449#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 133: Hoare triple {5449#false} assume !(~i~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 134: Hoare triple {5449#false} havoc ~x~0;~x~0 := 0; {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 135: Hoare triple {5449#false} assume !!(~x~0 < 200000); {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L273 TraceCheckUtils]: 136: Hoare triple {5449#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5449#false} is VALID [2018-11-23 12:27:13,134 INFO L256 TraceCheckUtils]: 137: Hoare triple {5449#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5449#false} is VALID [2018-11-23 12:27:13,135 INFO L273 TraceCheckUtils]: 138: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2018-11-23 12:27:13,135 INFO L273 TraceCheckUtils]: 139: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2018-11-23 12:27:13,135 INFO L273 TraceCheckUtils]: 140: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2018-11-23 12:27:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-11-23 12:27:13,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:13,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2018-11-23 12:27:13,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-11-23 12:27:13,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:13,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:27:13,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:13,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:27:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:27:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=518, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:27:13,298 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 31 states. [2018-11-23 12:27:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,549 INFO L93 Difference]: Finished difference Result 945 states and 1020 transitions. [2018-11-23 12:27:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:18,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-11-23 12:27:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 223 transitions. [2018-11-23 12:27:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 223 transitions. [2018-11-23 12:27:18,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 223 transitions. [2018-11-23 12:27:18,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:18,861 INFO L225 Difference]: With dead ends: 945 [2018-11-23 12:27:18,862 INFO L226 Difference]: Without dead ends: 785 [2018-11-23 12:27:18,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1280, Invalid=2142, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:27:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-23 12:27:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 230. [2018-11-23 12:27:19,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:19,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:19,322 INFO L74 IsIncluded]: Start isIncluded. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:19,322 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,361 INFO L93 Difference]: Finished difference Result 785 states and 815 transitions. [2018-11-23 12:27:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 815 transitions. [2018-11-23 12:27:19,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,363 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 785 states. [2018-11-23 12:27:19,363 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 785 states. [2018-11-23 12:27:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,402 INFO L93 Difference]: Finished difference Result 785 states and 815 transitions. [2018-11-23 12:27:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 815 transitions. [2018-11-23 12:27:19,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:19,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-23 12:27:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2018-11-23 12:27:19,412 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 141 [2018-11-23 12:27:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:19,413 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-11-23 12:27:19,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:27:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2018-11-23 12:27:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:27:19,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:19,415 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:19,415 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:19,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 165044102, now seen corresponding path program 6 times [2018-11-23 12:27:19,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9118#true} is VALID [2018-11-23 12:27:20,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {9118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9118#true} is VALID [2018-11-23 12:27:20,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2018-11-23 12:27:20,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #73#return; {9118#true} is VALID [2018-11-23 12:27:20,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret8 := main(); {9118#true} is VALID [2018-11-23 12:27:20,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {9118#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,522 INFO L273 TraceCheckUtils]: 38: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,547 INFO L273 TraceCheckUtils]: 40: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,553 INFO L273 TraceCheckUtils]: 41: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,557 INFO L273 TraceCheckUtils]: 43: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,562 INFO L273 TraceCheckUtils]: 50: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,562 INFO L273 TraceCheckUtils]: 51: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,562 INFO L273 TraceCheckUtils]: 52: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,563 INFO L273 TraceCheckUtils]: 54: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {9120#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,565 INFO L273 TraceCheckUtils]: 60: Hoare triple {9120#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,565 INFO L273 TraceCheckUtils]: 61: Hoare triple {9120#(<= main_~z~0 150000)} ~i~0 := 0; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,566 INFO L273 TraceCheckUtils]: 62: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {9120#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {9120#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {9120#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {9120#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,569 INFO L273 TraceCheckUtils]: 68: Hoare triple {9120#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {9120#(<= main_~z~0 150000)} is VALID [2018-11-23 12:27:20,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {9120#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {9121#(<= main_~i~0 150000)} is VALID [2018-11-23 12:27:20,570 INFO L273 TraceCheckUtils]: 70: Hoare triple {9121#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9122#(<= main_~i~0 150001)} is VALID [2018-11-23 12:27:20,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {9122#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {9122#(<= main_~i~0 150001)} is VALID [2018-11-23 12:27:20,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {9122#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9122#(<= main_~i~0 150001)} is VALID [2018-11-23 12:27:20,572 INFO L273 TraceCheckUtils]: 73: Hoare triple {9122#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9123#(<= main_~i~0 150002)} is VALID [2018-11-23 12:27:20,572 INFO L273 TraceCheckUtils]: 74: Hoare triple {9123#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {9123#(<= main_~i~0 150002)} is VALID [2018-11-23 12:27:20,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {9123#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9123#(<= main_~i~0 150002)} is VALID [2018-11-23 12:27:20,573 INFO L273 TraceCheckUtils]: 76: Hoare triple {9123#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9124#(<= main_~i~0 150003)} is VALID [2018-11-23 12:27:20,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {9124#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {9124#(<= main_~i~0 150003)} is VALID [2018-11-23 12:27:20,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {9124#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9124#(<= main_~i~0 150003)} is VALID [2018-11-23 12:27:20,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {9124#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9125#(<= main_~i~0 150004)} is VALID [2018-11-23 12:27:20,576 INFO L273 TraceCheckUtils]: 80: Hoare triple {9125#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {9125#(<= main_~i~0 150004)} is VALID [2018-11-23 12:27:20,576 INFO L273 TraceCheckUtils]: 81: Hoare triple {9125#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9125#(<= main_~i~0 150004)} is VALID [2018-11-23 12:27:20,577 INFO L273 TraceCheckUtils]: 82: Hoare triple {9125#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9126#(<= main_~i~0 150005)} is VALID [2018-11-23 12:27:20,577 INFO L273 TraceCheckUtils]: 83: Hoare triple {9126#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {9126#(<= main_~i~0 150005)} is VALID [2018-11-23 12:27:20,578 INFO L273 TraceCheckUtils]: 84: Hoare triple {9126#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9126#(<= main_~i~0 150005)} is VALID [2018-11-23 12:27:20,579 INFO L273 TraceCheckUtils]: 85: Hoare triple {9126#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9127#(<= main_~i~0 150006)} is VALID [2018-11-23 12:27:20,579 INFO L273 TraceCheckUtils]: 86: Hoare triple {9127#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {9127#(<= main_~i~0 150006)} is VALID [2018-11-23 12:27:20,580 INFO L273 TraceCheckUtils]: 87: Hoare triple {9127#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9127#(<= main_~i~0 150006)} is VALID [2018-11-23 12:27:20,580 INFO L273 TraceCheckUtils]: 88: Hoare triple {9127#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9128#(<= main_~i~0 150007)} is VALID [2018-11-23 12:27:20,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {9128#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {9128#(<= main_~i~0 150007)} is VALID [2018-11-23 12:27:20,581 INFO L273 TraceCheckUtils]: 90: Hoare triple {9128#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9128#(<= main_~i~0 150007)} is VALID [2018-11-23 12:27:20,582 INFO L273 TraceCheckUtils]: 91: Hoare triple {9128#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9129#(<= main_~i~0 150008)} is VALID [2018-11-23 12:27:20,582 INFO L273 TraceCheckUtils]: 92: Hoare triple {9129#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {9129#(<= main_~i~0 150008)} is VALID [2018-11-23 12:27:20,583 INFO L273 TraceCheckUtils]: 93: Hoare triple {9129#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9129#(<= main_~i~0 150008)} is VALID [2018-11-23 12:27:20,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {9129#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9130#(<= main_~i~0 150009)} is VALID [2018-11-23 12:27:20,584 INFO L273 TraceCheckUtils]: 95: Hoare triple {9130#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {9130#(<= main_~i~0 150009)} is VALID [2018-11-23 12:27:20,585 INFO L273 TraceCheckUtils]: 96: Hoare triple {9130#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9130#(<= main_~i~0 150009)} is VALID [2018-11-23 12:27:20,586 INFO L273 TraceCheckUtils]: 97: Hoare triple {9130#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9131#(<= main_~i~0 150010)} is VALID [2018-11-23 12:27:20,586 INFO L273 TraceCheckUtils]: 98: Hoare triple {9131#(<= main_~i~0 150010)} assume !!(~i~0 < 200000); {9131#(<= main_~i~0 150010)} is VALID [2018-11-23 12:27:20,587 INFO L273 TraceCheckUtils]: 99: Hoare triple {9131#(<= main_~i~0 150010)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9131#(<= main_~i~0 150010)} is VALID [2018-11-23 12:27:20,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {9131#(<= main_~i~0 150010)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9132#(<= main_~i~0 150011)} is VALID [2018-11-23 12:27:20,588 INFO L273 TraceCheckUtils]: 101: Hoare triple {9132#(<= main_~i~0 150011)} assume !!(~i~0 < 200000); {9132#(<= main_~i~0 150011)} is VALID [2018-11-23 12:27:20,588 INFO L273 TraceCheckUtils]: 102: Hoare triple {9132#(<= main_~i~0 150011)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9132#(<= main_~i~0 150011)} is VALID [2018-11-23 12:27:20,589 INFO L273 TraceCheckUtils]: 103: Hoare triple {9132#(<= main_~i~0 150011)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9133#(<= main_~i~0 150012)} is VALID [2018-11-23 12:27:20,590 INFO L273 TraceCheckUtils]: 104: Hoare triple {9133#(<= main_~i~0 150012)} assume !!(~i~0 < 200000); {9133#(<= main_~i~0 150012)} is VALID [2018-11-23 12:27:20,590 INFO L273 TraceCheckUtils]: 105: Hoare triple {9133#(<= main_~i~0 150012)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9133#(<= main_~i~0 150012)} is VALID [2018-11-23 12:27:20,591 INFO L273 TraceCheckUtils]: 106: Hoare triple {9133#(<= main_~i~0 150012)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9134#(<= main_~i~0 150013)} is VALID [2018-11-23 12:27:20,591 INFO L273 TraceCheckUtils]: 107: Hoare triple {9134#(<= main_~i~0 150013)} assume !!(~i~0 < 200000); {9134#(<= main_~i~0 150013)} is VALID [2018-11-23 12:27:20,592 INFO L273 TraceCheckUtils]: 108: Hoare triple {9134#(<= main_~i~0 150013)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9134#(<= main_~i~0 150013)} is VALID [2018-11-23 12:27:20,593 INFO L273 TraceCheckUtils]: 109: Hoare triple {9134#(<= main_~i~0 150013)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9135#(<= main_~i~0 150014)} is VALID [2018-11-23 12:27:20,593 INFO L273 TraceCheckUtils]: 110: Hoare triple {9135#(<= main_~i~0 150014)} assume !!(~i~0 < 200000); {9135#(<= main_~i~0 150014)} is VALID [2018-11-23 12:27:20,594 INFO L273 TraceCheckUtils]: 111: Hoare triple {9135#(<= main_~i~0 150014)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9135#(<= main_~i~0 150014)} is VALID [2018-11-23 12:27:20,595 INFO L273 TraceCheckUtils]: 112: Hoare triple {9135#(<= main_~i~0 150014)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9136#(<= main_~i~0 150015)} is VALID [2018-11-23 12:27:20,595 INFO L273 TraceCheckUtils]: 113: Hoare triple {9136#(<= main_~i~0 150015)} assume !!(~i~0 < 200000); {9136#(<= main_~i~0 150015)} is VALID [2018-11-23 12:27:20,596 INFO L273 TraceCheckUtils]: 114: Hoare triple {9136#(<= main_~i~0 150015)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9136#(<= main_~i~0 150015)} is VALID [2018-11-23 12:27:20,596 INFO L273 TraceCheckUtils]: 115: Hoare triple {9136#(<= main_~i~0 150015)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9137#(<= main_~i~0 150016)} is VALID [2018-11-23 12:27:20,597 INFO L273 TraceCheckUtils]: 116: Hoare triple {9137#(<= main_~i~0 150016)} assume !!(~i~0 < 200000); {9137#(<= main_~i~0 150016)} is VALID [2018-11-23 12:27:20,597 INFO L273 TraceCheckUtils]: 117: Hoare triple {9137#(<= main_~i~0 150016)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9137#(<= main_~i~0 150016)} is VALID [2018-11-23 12:27:20,598 INFO L273 TraceCheckUtils]: 118: Hoare triple {9137#(<= main_~i~0 150016)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9138#(<= main_~i~0 150017)} is VALID [2018-11-23 12:27:20,598 INFO L273 TraceCheckUtils]: 119: Hoare triple {9138#(<= main_~i~0 150017)} assume !!(~i~0 < 200000); {9138#(<= main_~i~0 150017)} is VALID [2018-11-23 12:27:20,599 INFO L273 TraceCheckUtils]: 120: Hoare triple {9138#(<= main_~i~0 150017)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9138#(<= main_~i~0 150017)} is VALID [2018-11-23 12:27:20,600 INFO L273 TraceCheckUtils]: 121: Hoare triple {9138#(<= main_~i~0 150017)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9139#(<= main_~i~0 150018)} is VALID [2018-11-23 12:27:20,600 INFO L273 TraceCheckUtils]: 122: Hoare triple {9139#(<= main_~i~0 150018)} assume !!(~i~0 < 200000); {9139#(<= main_~i~0 150018)} is VALID [2018-11-23 12:27:20,601 INFO L273 TraceCheckUtils]: 123: Hoare triple {9139#(<= main_~i~0 150018)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9139#(<= main_~i~0 150018)} is VALID [2018-11-23 12:27:20,601 INFO L273 TraceCheckUtils]: 124: Hoare triple {9139#(<= main_~i~0 150018)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9140#(<= main_~i~0 150019)} is VALID [2018-11-23 12:27:20,602 INFO L273 TraceCheckUtils]: 125: Hoare triple {9140#(<= main_~i~0 150019)} assume !!(~i~0 < 200000); {9140#(<= main_~i~0 150019)} is VALID [2018-11-23 12:27:20,602 INFO L273 TraceCheckUtils]: 126: Hoare triple {9140#(<= main_~i~0 150019)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9140#(<= main_~i~0 150019)} is VALID [2018-11-23 12:27:20,603 INFO L273 TraceCheckUtils]: 127: Hoare triple {9140#(<= main_~i~0 150019)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9141#(<= main_~i~0 150020)} is VALID [2018-11-23 12:27:20,604 INFO L273 TraceCheckUtils]: 128: Hoare triple {9141#(<= main_~i~0 150020)} assume !!(~i~0 < 200000); {9141#(<= main_~i~0 150020)} is VALID [2018-11-23 12:27:20,604 INFO L273 TraceCheckUtils]: 129: Hoare triple {9141#(<= main_~i~0 150020)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9141#(<= main_~i~0 150020)} is VALID [2018-11-23 12:27:20,605 INFO L273 TraceCheckUtils]: 130: Hoare triple {9141#(<= main_~i~0 150020)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9142#(<= main_~i~0 150021)} is VALID [2018-11-23 12:27:20,605 INFO L273 TraceCheckUtils]: 131: Hoare triple {9142#(<= main_~i~0 150021)} assume !!(~i~0 < 200000); {9142#(<= main_~i~0 150021)} is VALID [2018-11-23 12:27:20,606 INFO L273 TraceCheckUtils]: 132: Hoare triple {9142#(<= main_~i~0 150021)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9142#(<= main_~i~0 150021)} is VALID [2018-11-23 12:27:20,606 INFO L273 TraceCheckUtils]: 133: Hoare triple {9142#(<= main_~i~0 150021)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9143#(<= main_~i~0 150022)} is VALID [2018-11-23 12:27:20,607 INFO L273 TraceCheckUtils]: 134: Hoare triple {9143#(<= main_~i~0 150022)} assume !!(~i~0 < 200000); {9143#(<= main_~i~0 150022)} is VALID [2018-11-23 12:27:20,607 INFO L273 TraceCheckUtils]: 135: Hoare triple {9143#(<= main_~i~0 150022)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9143#(<= main_~i~0 150022)} is VALID [2018-11-23 12:27:20,608 INFO L273 TraceCheckUtils]: 136: Hoare triple {9143#(<= main_~i~0 150022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9144#(<= main_~i~0 150023)} is VALID [2018-11-23 12:27:20,609 INFO L273 TraceCheckUtils]: 137: Hoare triple {9144#(<= main_~i~0 150023)} assume !!(~i~0 < 200000); {9144#(<= main_~i~0 150023)} is VALID [2018-11-23 12:27:20,609 INFO L273 TraceCheckUtils]: 138: Hoare triple {9144#(<= main_~i~0 150023)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9144#(<= main_~i~0 150023)} is VALID [2018-11-23 12:27:20,610 INFO L273 TraceCheckUtils]: 139: Hoare triple {9144#(<= main_~i~0 150023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9145#(<= main_~i~0 150024)} is VALID [2018-11-23 12:27:20,610 INFO L273 TraceCheckUtils]: 140: Hoare triple {9145#(<= main_~i~0 150024)} assume !!(~i~0 < 200000); {9145#(<= main_~i~0 150024)} is VALID [2018-11-23 12:27:20,611 INFO L273 TraceCheckUtils]: 141: Hoare triple {9145#(<= main_~i~0 150024)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9145#(<= main_~i~0 150024)} is VALID [2018-11-23 12:27:20,612 INFO L273 TraceCheckUtils]: 142: Hoare triple {9145#(<= main_~i~0 150024)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9146#(<= main_~i~0 150025)} is VALID [2018-11-23 12:27:20,612 INFO L273 TraceCheckUtils]: 143: Hoare triple {9146#(<= main_~i~0 150025)} assume !(~i~0 < 200000); {9119#false} is VALID [2018-11-23 12:27:20,612 INFO L273 TraceCheckUtils]: 144: Hoare triple {9119#false} havoc ~x~0;~x~0 := 0; {9119#false} is VALID [2018-11-23 12:27:20,613 INFO L273 TraceCheckUtils]: 145: Hoare triple {9119#false} assume !!(~x~0 < 200000); {9119#false} is VALID [2018-11-23 12:27:20,613 INFO L273 TraceCheckUtils]: 146: Hoare triple {9119#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9119#false} is VALID [2018-11-23 12:27:20,613 INFO L256 TraceCheckUtils]: 147: Hoare triple {9119#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9119#false} is VALID [2018-11-23 12:27:20,613 INFO L273 TraceCheckUtils]: 148: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2018-11-23 12:27:20,614 INFO L273 TraceCheckUtils]: 149: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2018-11-23 12:27:20,614 INFO L273 TraceCheckUtils]: 150: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2018-11-23 12:27:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1073 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2018-11-23 12:27:20,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:20,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:20,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE