java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,235 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,285 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,289 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,373 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-23 11:51:45,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34de5323/463246ec73154b8fbdb2967622ef3e30/FLAGb3d34c2d2 [2018-11-23 11:51:45,862 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,863 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-23 11:51:45,869 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34de5323/463246ec73154b8fbdb2967622ef3e30/FLAGb3d34c2d2 [2018-11-23 11:51:46,251 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34de5323/463246ec73154b8fbdb2967622ef3e30 [2018-11-23 11:51:46,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caf9534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,584 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,610 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,607 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,607 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:51:47,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47 BoogieIcfgContainer [2018-11-23 11:51:47,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:47,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c799a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:47,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c799a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47" (3/3) ... [2018-11-23 11:51:47,616 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_false-unreach-call_ground.i [2018-11-23 11:51:47,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:47,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:47,678 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:47,678 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:47,678 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:47,678 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:47,678 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:47,678 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:47,679 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:47,679 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:51:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:51:47,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:47,708 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 11:51:47,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:51:47,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 11:51:47,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 11:51:47,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 11:51:47,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2018-11-23 11:51:47,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {33#true} is VALID [2018-11-23 11:51:47,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 11:51:47,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0; {34#false} is VALID [2018-11-23 11:51:47,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(~i~0 < 100000); {34#false} is VALID [2018-11-23 11:51:47,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 11:51:47,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !(~i~0 < 100000); {34#false} is VALID [2018-11-23 11:51:47,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} havoc ~x~0;~x~0 := 0; {34#false} is VALID [2018-11-23 11:51:47,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {34#false} is VALID [2018-11-23 11:51:47,887 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {34#false} is VALID [2018-11-23 11:51:47,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 11:51:47,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 11:51:47,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:51:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:47,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:47,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:47,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:51:47,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:47,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,064 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 11:51:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,356 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 11:51:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:51:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:51:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:51:48,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 11:51:48,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,864 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:51:48,864 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:51:48,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:51:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:51:48,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:48,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:51:48,918 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:51:48,918 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:51:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,923 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:51:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:51:48,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,924 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:51:48,924 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:51:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,929 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:51:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:51:48,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:48,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:51:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:51:48,935 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 11:51:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:48,936 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:51:48,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:51:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:51:48,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 11:51:48,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 11:51:49,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {189#true} is VALID [2018-11-23 11:51:49,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 11:51:49,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #77#return; {189#true} is VALID [2018-11-23 11:51:49,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret10 := main(); {189#true} is VALID [2018-11-23 11:51:49,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {191#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(= main_~a~0 0)} assume !(~a~0 < 100000); {190#false} is VALID [2018-11-23 11:51:49,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#false} havoc ~i~0;~i~0 := 0; {190#false} is VALID [2018-11-23 11:51:49,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#false} assume !(~i~0 < 100000); {190#false} is VALID [2018-11-23 11:51:49,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~i~0 := 0; {190#false} is VALID [2018-11-23 11:51:49,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume !(~i~0 < 100000); {190#false} is VALID [2018-11-23 11:51:49,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} havoc ~x~0;~x~0 := 0; {190#false} is VALID [2018-11-23 11:51:49,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {190#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {190#false} is VALID [2018-11-23 11:51:49,032 INFO L256 TraceCheckUtils]: 13: Hoare triple {190#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {190#false} is VALID [2018-11-23 11:51:49,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 11:51:49,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 11:51:49,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 11:51:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:51:49,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,081 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 11:51:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,227 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:51:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:51:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:51:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:51:49,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-23 11:51:49,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,636 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:51:49,636 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:51:49,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:51:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 11:51:49,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:49,655 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:49,656 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,659 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 11:51:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:51:49,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,661 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 11:51:49,661 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 11:51:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,663 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 11:51:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:51:49,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:51:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 11:51:49,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-23 11:51:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 11:51:49,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:51:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:49,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1114616120, now seen corresponding path program 1 times [2018-11-23 11:51:49,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2018-11-23 11:51:49,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {345#true} is VALID [2018-11-23 11:51:49,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {345#true} assume true; {345#true} is VALID [2018-11-23 11:51:49,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} #77#return; {345#true} is VALID [2018-11-23 11:51:49,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {345#true} call #t~ret10 := main(); {345#true} is VALID [2018-11-23 11:51:49,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {345#true} is VALID [2018-11-23 11:51:49,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {345#true} is VALID [2018-11-23 11:51:49,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {345#true} is VALID [2018-11-23 11:51:49,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#true} assume !(~a~0 < 100000); {345#true} is VALID [2018-11-23 11:51:49,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#true} havoc ~i~0;~i~0 := 0; {347#(= main_~i~0 0)} is VALID [2018-11-23 11:51:49,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#(= main_~i~0 0)} assume !(~i~0 < 100000); {346#false} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {346#false} ~i~0 := 0; {346#false} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {346#false} assume !(~i~0 < 100000); {346#false} is VALID [2018-11-23 11:51:49,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {346#false} havoc ~x~0;~x~0 := 0; {346#false} is VALID [2018-11-23 11:51:49,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {346#false} is VALID [2018-11-23 11:51:49,785 INFO L256 TraceCheckUtils]: 15: Hoare triple {346#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {346#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#false} ~cond := #in~cond; {346#false} is VALID [2018-11-23 11:51:49,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {346#false} assume 0 == ~cond; {346#false} is VALID [2018-11-23 11:51:49,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {346#false} assume !false; {346#false} is VALID [2018-11-23 11:51:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:49,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:51:49,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,922 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-23 11:51:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,125 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:51:50,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:51:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:51:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:51:50,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 11:51:50,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,271 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:51:50,272 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:51:50,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:51:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 11:51:50,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 11:51:50,288 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 11:51:50,288 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 11:51:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,291 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 11:51:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:51:50,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,292 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 11:51:50,292 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 11:51:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,295 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 11:51:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:51:50,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:51:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 11:51:50,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-23 11:51:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,299 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 11:51:50,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:51:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:50,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,300 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -825329612, now seen corresponding path program 1 times [2018-11-23 11:51:50,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 11:51:50,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-23 11:51:50,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 11:51:50,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #77#return; {512#true} is VALID [2018-11-23 11:51:50,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret10 := main(); {512#true} is VALID [2018-11-23 11:51:50,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {514#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {514#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {514#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {514#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {515#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(<= main_~a~0 1)} assume !(~a~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} havoc ~i~0;~i~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {513#false} is VALID [2018-11-23 11:51:50,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {513#false} is VALID [2018-11-23 11:51:50,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {513#false} is VALID [2018-11-23 11:51:50,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {513#false} is VALID [2018-11-23 11:51:50,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} havoc ~x~0;~x~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {513#false} is VALID [2018-11-23 11:51:50,432 INFO L256 TraceCheckUtils]: 19: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {513#false} is VALID [2018-11-23 11:51:50,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 11:51:50,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {513#false} assume 0 == ~cond; {513#false} is VALID [2018-11-23 11:51:50,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 11:51:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:51:50,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:50,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:50,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 11:51:50,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-23 11:51:50,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 11:51:50,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #77#return; {512#true} is VALID [2018-11-23 11:51:50,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret10 := main(); {512#true} is VALID [2018-11-23 11:51:50,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {534#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:50,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {534#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {534#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:50,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {534#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {515#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(<= main_~a~0 1)} assume !(~a~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} havoc ~i~0;~i~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {513#false} is VALID [2018-11-23 11:51:50,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {513#false} is VALID [2018-11-23 11:51:50,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {513#false} is VALID [2018-11-23 11:51:50,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {513#false} is VALID [2018-11-23 11:51:50,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(~i~0 < 100000); {513#false} is VALID [2018-11-23 11:51:50,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} havoc ~x~0;~x~0 := 0; {513#false} is VALID [2018-11-23 11:51:50,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {513#false} is VALID [2018-11-23 11:51:50,845 INFO L256 TraceCheckUtils]: 19: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {513#false} is VALID [2018-11-23 11:51:50,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 11:51:50,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {513#false} assume 0 == ~cond; {513#false} is VALID [2018-11-23 11:51:50,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 11:51:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:51:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:50,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:50,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:51:50,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:50,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:50,950 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-23 11:51:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,299 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 11:51:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:51:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:51:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:51:51,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-23 11:51:51,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,427 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:51:51,427 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:51:51,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:51:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 11:51:51,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 11:51:51,438 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 11:51:51,438 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 11:51:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,442 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:51:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:51:51,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,443 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 11:51:51,443 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 11:51:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,446 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:51:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:51:51,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:51:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 11:51:51,449 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2018-11-23 11:51:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,450 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 11:51:51,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:51:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:51:51,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,451 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash -425990958, now seen corresponding path program 2 times [2018-11-23 11:51:51,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 11:51:51,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-23 11:51:51,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 11:51:51,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #77#return; {762#true} is VALID [2018-11-23 11:51:51,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret10 := main(); {762#true} is VALID [2018-11-23 11:51:51,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {764#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {764#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {765#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {765#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {766#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~a~0 2)} assume !(~a~0 < 100000); {763#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#false} havoc ~i~0;~i~0 := 0; {763#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {763#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {763#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {763#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {763#false} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {763#false} ~i~0 := 0; {763#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {763#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {763#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {763#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {763#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {763#false} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-23 11:51:51,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-23 11:51:51,584 INFO L256 TraceCheckUtils]: 21: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {763#false} is VALID [2018-11-23 11:51:51,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 11:51:51,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 11:51:51,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 11:51:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:51:51,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:51,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:51,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 11:51:51,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-23 11:51:51,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 11:51:51,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #77#return; {762#true} is VALID [2018-11-23 11:51:51,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret10 := main(); {762#true} is VALID [2018-11-23 11:51:51,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {762#true} is VALID [2018-11-23 11:51:51,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {762#true} is VALID [2018-11-23 11:51:51,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {762#true} is VALID [2018-11-23 11:51:51,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {762#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {762#true} is VALID [2018-11-23 11:51:51,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {762#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {762#true} is VALID [2018-11-23 11:51:51,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {762#true} assume !(~a~0 < 100000); {762#true} is VALID [2018-11-23 11:51:51,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {762#true} havoc ~i~0;~i~0 := 0; {762#true} is VALID [2018-11-23 11:51:51,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {762#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {762#true} is VALID [2018-11-23 11:51:51,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {762#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {762#true} is VALID [2018-11-23 11:51:51,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#true} assume !(~i~0 < 100000); {762#true} is VALID [2018-11-23 11:51:51,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {762#true} ~i~0 := 0; {815#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:51,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {815#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {815#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:51,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {815#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {822#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:51,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {822#(<= main_~i~0 1)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 11:51:51,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-23 11:51:51,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {763#false} is VALID [2018-11-23 11:51:51,750 INFO L256 TraceCheckUtils]: 21: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {763#false} is VALID [2018-11-23 11:51:51,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 11:51:51,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 11:51:51,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 11:51:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:51,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:51,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:51,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:51,849 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2018-11-23 11:51:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,105 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 11:51:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:52,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:51:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:51:52,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2018-11-23 11:51:52,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,243 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:51:52,243 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:51:52,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:51:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 11:51:52,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-23 11:51:52,263 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-23 11:51:52,263 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-23 11:51:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,265 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:51:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:51:52,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,267 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-23 11:51:52,267 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-23 11:51:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,269 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:51:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:51:52,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:51:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 11:51:52,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2018-11-23 11:51:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,273 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 11:51:52,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 11:51:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:52,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,275 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,275 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2001812716, now seen corresponding path program 3 times [2018-11-23 11:51:52,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2018-11-23 11:51:52,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1056#true} is VALID [2018-11-23 11:51:52,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2018-11-23 11:51:52,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #77#return; {1056#true} is VALID [2018-11-23 11:51:52,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret10 := main(); {1056#true} is VALID [2018-11-23 11:51:52,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {1056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1058#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1058#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {1058#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1059#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1059#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {1059#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1060#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {1060#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1060#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {1060#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1061#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:52,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1057#false} is VALID [2018-11-23 11:51:52,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {1057#false} havoc ~i~0;~i~0 := 0; {1057#false} is VALID [2018-11-23 11:51:52,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1057#false} is VALID [2018-11-23 11:51:52,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1057#false} is VALID [2018-11-23 11:51:52,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1057#false} is VALID [2018-11-23 11:51:52,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {1057#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1057#false} is VALID [2018-11-23 11:51:52,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {1057#false} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:51:52,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {1057#false} ~i~0 := 0; {1057#false} is VALID [2018-11-23 11:51:52,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1057#false} is VALID [2018-11-23 11:51:52,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1057#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1057#false} is VALID [2018-11-23 11:51:52,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1057#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1057#false} is VALID [2018-11-23 11:51:52,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {1057#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1057#false} is VALID [2018-11-23 11:51:52,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {1057#false} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:51:52,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {1057#false} havoc ~x~0;~x~0 := 0; {1057#false} is VALID [2018-11-23 11:51:52,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {1057#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1057#false} is VALID [2018-11-23 11:51:52,533 INFO L256 TraceCheckUtils]: 27: Hoare triple {1057#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1057#false} is VALID [2018-11-23 11:51:52,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2018-11-23 11:51:52,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2018-11-23 11:51:52,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2018-11-23 11:51:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:51:52,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:52,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:52,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:52,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2018-11-23 11:51:52,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1056#true} is VALID [2018-11-23 11:51:52,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2018-11-23 11:51:52,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #77#return; {1056#true} is VALID [2018-11-23 11:51:52,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret10 := main(); {1056#true} is VALID [2018-11-23 11:51:52,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {1056#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1056#true} is VALID [2018-11-23 11:51:52,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1056#true} is VALID [2018-11-23 11:51:52,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:51:52,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1056#true} is VALID [2018-11-23 11:51:52,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:51:52,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {1056#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1056#true} is VALID [2018-11-23 11:51:52,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1056#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#true} is VALID [2018-11-23 11:51:52,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1056#true} assume !(~a~0 < 100000); {1056#true} is VALID [2018-11-23 11:51:52,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {1056#true} havoc ~i~0;~i~0 := 0; {1056#true} is VALID [2018-11-23 11:51:52,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {1056#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1056#true} is VALID [2018-11-23 11:51:52,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {1056#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1056#true} is VALID [2018-11-23 11:51:52,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {1056#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1056#true} is VALID [2018-11-23 11:51:52,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {1056#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1056#true} is VALID [2018-11-23 11:51:52,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#true} assume !(~i~0 < 100000); {1056#true} is VALID [2018-11-23 11:51:52,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {1056#true} ~i~0 := 0; {1122#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,836 INFO L273 TraceCheckUtils]: 20: Hoare triple {1122#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1122#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {1122#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1129#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {1129#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1129#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {1129#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1136#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {1136#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1057#false} is VALID [2018-11-23 11:51:52,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {1057#false} havoc ~x~0;~x~0 := 0; {1057#false} is VALID [2018-11-23 11:51:52,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {1057#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1057#false} is VALID [2018-11-23 11:51:52,885 INFO L256 TraceCheckUtils]: 27: Hoare triple {1057#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1057#false} is VALID [2018-11-23 11:51:52,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2018-11-23 11:51:52,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2018-11-23 11:51:52,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2018-11-23 11:51:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:51:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:52,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:52,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:52,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:52,982 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 9 states. [2018-11-23 11:51:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,454 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-23 11:51:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:53,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 11:51:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-23 11:51:53,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2018-11-23 11:51:53,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,556 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:51:53,556 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:53,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:51:53,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:51:53,582 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:51:53,582 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:51:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,584 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:51:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:51:53,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,586 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:51:53,586 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:51:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,588 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:51:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:51:53,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 11:51:53,592 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2018-11-23 11:51:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 11:51:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 11:51:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:53,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,594 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1767528838, now seen corresponding path program 4 times [2018-11-23 11:51:53,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {1406#true} call ULTIMATE.init(); {1406#true} is VALID [2018-11-23 11:51:53,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1406#true} is VALID [2018-11-23 11:51:53,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {1406#true} assume true; {1406#true} is VALID [2018-11-23 11:51:53,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1406#true} {1406#true} #77#return; {1406#true} is VALID [2018-11-23 11:51:53,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {1406#true} call #t~ret10 := main(); {1406#true} is VALID [2018-11-23 11:51:53,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {1406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1408#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1408#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {1409#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {1410#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {1410#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {1411#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {1411#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1412#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:53,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:53,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {1407#false} havoc ~i~0;~i~0 := 0; {1407#false} is VALID [2018-11-23 11:51:53,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:53,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:53,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:53,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:53,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:53,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:53,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:53,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#false} ~i~0 := 0; {1407#false} is VALID [2018-11-23 11:51:53,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:53,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:53,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:53,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:53,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:53,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:53,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:53,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {1407#false} havoc ~x~0;~x~0 := 0; {1407#false} is VALID [2018-11-23 11:51:53,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1407#false} is VALID [2018-11-23 11:51:53,802 INFO L256 TraceCheckUtils]: 33: Hoare triple {1407#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1407#false} is VALID [2018-11-23 11:51:53,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {1407#false} ~cond := #in~cond; {1407#false} is VALID [2018-11-23 11:51:53,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {1407#false} assume 0 == ~cond; {1407#false} is VALID [2018-11-23 11:51:53,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2018-11-23 11:51:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:51:53,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:53,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:53,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:53,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {1406#true} call ULTIMATE.init(); {1406#true} is VALID [2018-11-23 11:51:54,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1406#true} is VALID [2018-11-23 11:51:54,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {1406#true} assume true; {1406#true} is VALID [2018-11-23 11:51:54,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1406#true} {1406#true} #77#return; {1406#true} is VALID [2018-11-23 11:51:54,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {1406#true} call #t~ret10 := main(); {1406#true} is VALID [2018-11-23 11:51:54,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {1406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1431#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:54,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1431#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:54,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {1409#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1409#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {1410#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1410#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {1410#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {1411#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1411#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {1411#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1412#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:54,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {1407#false} havoc ~i~0;~i~0 := 0; {1407#false} is VALID [2018-11-23 11:51:54,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:54,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:54,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:54,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:54,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1407#false} is VALID [2018-11-23 11:51:54,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1407#false} is VALID [2018-11-23 11:51:54,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:54,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#false} ~i~0 := 0; {1407#false} is VALID [2018-11-23 11:51:54,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:54,122 INFO L273 TraceCheckUtils]: 25: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {1407#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {1407#false} assume !(~i~0 < 100000); {1407#false} is VALID [2018-11-23 11:51:54,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {1407#false} havoc ~x~0;~x~0 := 0; {1407#false} is VALID [2018-11-23 11:51:54,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1407#false} is VALID [2018-11-23 11:51:54,124 INFO L256 TraceCheckUtils]: 33: Hoare triple {1407#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1407#false} is VALID [2018-11-23 11:51:54,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {1407#false} ~cond := #in~cond; {1407#false} is VALID [2018-11-23 11:51:54,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {1407#false} assume 0 == ~cond; {1407#false} is VALID [2018-11-23 11:51:54,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2018-11-23 11:51:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:51:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:54,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:51:54,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:54,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,191 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-11-23 11:51:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,406 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-23 11:51:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 11:51:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 11:51:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-23 11:51:54,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-23 11:51:54,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,617 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:51:54,617 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:54,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:51:54,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:54,643 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:54,643 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,644 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:51:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:51:54,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,645 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:54,645 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,647 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 11:51:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 11:51:54,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:51:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-23 11:51:54,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2018-11-23 11:51:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,652 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-23 11:51:54,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 11:51:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:51:54,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,653 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,653 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1554405796, now seen corresponding path program 5 times [2018-11-23 11:51:54,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-23 11:51:54,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1783#true} is VALID [2018-11-23 11:51:54,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-23 11:51:54,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #77#return; {1783#true} is VALID [2018-11-23 11:51:54,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret10 := main(); {1783#true} is VALID [2018-11-23 11:51:54,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {1783#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1785#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {1785#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1785#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {1785#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1786#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1786#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1787#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {1787#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1787#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1788#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {1788#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1788#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {1788#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1789#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {1789#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1789#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {1789#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1790#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:54,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#(<= main_~a~0 5)} assume !(~a~0 < 100000); {1784#false} is VALID [2018-11-23 11:51:54,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {1784#false} havoc ~i~0;~i~0 := 0; {1784#false} is VALID [2018-11-23 11:51:54,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1784#false} is VALID [2018-11-23 11:51:54,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {1784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1784#false} is VALID [2018-11-23 11:51:54,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1784#false} is VALID [2018-11-23 11:51:54,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {1784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1784#false} is VALID [2018-11-23 11:51:54,821 INFO L273 TraceCheckUtils]: 22: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1784#false} is VALID [2018-11-23 11:51:54,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {1784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1784#false} is VALID [2018-11-23 11:51:54,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:51:54,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {1784#false} ~i~0 := 0; {1784#false} is VALID [2018-11-23 11:51:54,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:54,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:54,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:51:54,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {1784#false} havoc ~x~0;~x~0 := 0; {1784#false} is VALID [2018-11-23 11:51:54,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {1784#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1784#false} is VALID [2018-11-23 11:51:54,825 INFO L256 TraceCheckUtils]: 35: Hoare triple {1784#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1784#false} is VALID [2018-11-23 11:51:54,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-23 11:51:54,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-23 11:51:54,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-23 11:51:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:51:54,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:55,475 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:55,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-23 11:51:55,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1783#true} is VALID [2018-11-23 11:51:55,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-23 11:51:55,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #77#return; {1783#true} is VALID [2018-11-23 11:51:55,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret10 := main(); {1783#true} is VALID [2018-11-23 11:51:55,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {1783#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1783#true} is VALID [2018-11-23 11:51:55,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#true} is VALID [2018-11-23 11:51:55,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:51:55,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:51:55,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#true} is VALID [2018-11-23 11:51:55,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {1783#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#true} is VALID [2018-11-23 11:51:55,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {1783#true} assume !(~a~0 < 100000); {1783#true} is VALID [2018-11-23 11:51:55,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {1783#true} havoc ~i~0;~i~0 := 0; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {1845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {1845#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1852#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {1852#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1852#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {1852#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1859#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1859#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {1859#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1866#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {1866#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:51:55,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {1784#false} ~i~0 := 0; {1784#false} is VALID [2018-11-23 11:51:55,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:55,698 INFO L273 TraceCheckUtils]: 27: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:55,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:55,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:55,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1784#false} is VALID [2018-11-23 11:51:55,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {1784#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1784#false} is VALID [2018-11-23 11:51:55,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {1784#false} assume !(~i~0 < 100000); {1784#false} is VALID [2018-11-23 11:51:55,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {1784#false} havoc ~x~0;~x~0 := 0; {1784#false} is VALID [2018-11-23 11:51:55,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {1784#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {1784#false} is VALID [2018-11-23 11:51:55,701 INFO L256 TraceCheckUtils]: 35: Hoare triple {1784#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {1784#false} is VALID [2018-11-23 11:51:55,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-23 11:51:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 11:51:55,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:51:55,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:51:55,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:55,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:55,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:55,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:55,776 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2018-11-23 11:51:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,229 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:51:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:51:56,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:51:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2018-11-23 11:51:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2018-11-23 11:51:56,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 78 transitions. [2018-11-23 11:51:56,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,413 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:51:56,413 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:51:56,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:51:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-23 11:51:56,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 50 states. [2018-11-23 11:51:56,452 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 50 states. [2018-11-23 11:51:56,452 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 50 states. [2018-11-23 11:51:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,454 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:51:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:51:56,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,455 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states. [2018-11-23 11:51:56,455 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states. [2018-11-23 11:51:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,457 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:51:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:51:56,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:51:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-23 11:51:56,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2018-11-23 11:51:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,460 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-23 11:51:56,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-23 11:51:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:51:56,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,462 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,462 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1783680062, now seen corresponding path program 6 times [2018-11-23 11:51:56,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 11:51:56,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 11:51:56,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #77#return; {2206#true} is VALID [2018-11-23 11:51:56,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret10 := main(); {2206#true} is VALID [2018-11-23 11:51:56,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2208#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2208#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2209#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2209#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2210#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2210#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2211#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2211#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2212#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2212#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2213#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:56,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2213#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:56,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {2213#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2214#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:56,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {2214#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2207#false} is VALID [2018-11-23 11:51:56,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {2207#false} havoc ~i~0;~i~0 := 0; {2207#false} is VALID [2018-11-23 11:51:56,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2207#false} is VALID [2018-11-23 11:51:56,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {2207#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2207#false} is VALID [2018-11-23 11:51:56,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2207#false} is VALID [2018-11-23 11:51:56,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {2207#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2207#false} is VALID [2018-11-23 11:51:56,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2207#false} is VALID [2018-11-23 11:51:56,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2207#false} is VALID [2018-11-23 11:51:56,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2207#false} is VALID [2018-11-23 11:51:56,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2207#false} is VALID [2018-11-23 11:51:56,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:51:56,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#false} ~i~0 := 0; {2207#false} is VALID [2018-11-23 11:51:56,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2207#false} is VALID [2018-11-23 11:51:56,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2207#false} is VALID [2018-11-23 11:51:56,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2207#false} is VALID [2018-11-23 11:51:56,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2207#false} is VALID [2018-11-23 11:51:56,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2207#false} is VALID [2018-11-23 11:51:56,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2207#false} is VALID [2018-11-23 11:51:56,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2207#false} is VALID [2018-11-23 11:51:56,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {2207#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2207#false} is VALID [2018-11-23 11:51:56,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:51:56,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} havoc ~x~0;~x~0 := 0; {2207#false} is VALID [2018-11-23 11:51:56,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2207#false} is VALID [2018-11-23 11:51:56,802 INFO L256 TraceCheckUtils]: 41: Hoare triple {2207#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2207#false} is VALID [2018-11-23 11:51:56,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2018-11-23 11:51:56,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2018-11-23 11:51:56,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 11:51:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:51:56,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:56,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:51:57,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:51:57,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 11:51:57,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 11:51:57,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 11:51:57,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #77#return; {2206#true} is VALID [2018-11-23 11:51:57,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret10 := main(); {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {2206#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} assume !(~a~0 < 100000); {2206#true} is VALID [2018-11-23 11:51:57,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} havoc ~i~0;~i~0 := 0; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 11:51:57,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2206#true} is VALID [2018-11-23 11:51:57,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {2206#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 11:51:57,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 11:51:57,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~i~0 := 0; {2305#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:57,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {2305#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2305#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:57,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {2305#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2312#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {2312#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2312#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:57,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {2312#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2319#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {2319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2319#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:57,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {2319#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2326#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {2326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2326#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:57,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {2326#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2333#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:57,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 11:51:57,174 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} havoc ~x~0;~x~0 := 0; {2207#false} is VALID [2018-11-23 11:51:57,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2207#false} is VALID [2018-11-23 11:51:57,175 INFO L256 TraceCheckUtils]: 41: Hoare triple {2207#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2207#false} is VALID [2018-11-23 11:51:57,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2018-11-23 11:51:57,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2018-11-23 11:51:57,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 11:51:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:51:57,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:51:57,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:51:57,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:51:57,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:51:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:51:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:51:57,257 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 14 states. [2018-11-23 11:51:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,865 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:51:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:51:57,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:51:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:51:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-23 11:51:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:51:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2018-11-23 11:51:57,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 84 transitions. [2018-11-23 11:51:58,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,008 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:51:58,008 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:51:58,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:51:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:51:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-23 11:51:58,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 56 states. [2018-11-23 11:51:58,058 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 56 states. [2018-11-23 11:51:58,058 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 56 states. [2018-11-23 11:51:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,061 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:51:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:51:58,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,062 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 59 states. [2018-11-23 11:51:58,062 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 59 states. [2018-11-23 11:51:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,064 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:51:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:51:58,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:51:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-23 11:51:58,066 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 45 [2018-11-23 11:51:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,067 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-23 11:51:58,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:51:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-23 11:51:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:51:58,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,068 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash -52354216, now seen corresponding path program 7 times [2018-11-23 11:51:58,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2685#true} is VALID [2018-11-23 11:51:58,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {2685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2685#true} is VALID [2018-11-23 11:51:58,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2018-11-23 11:51:58,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #77#return; {2685#true} is VALID [2018-11-23 11:51:58,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret10 := main(); {2685#true} is VALID [2018-11-23 11:51:58,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {2685#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2687#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {2687#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2687#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {2687#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {2688#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {2689#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {2689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {2690#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {2690#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {2691#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {2691#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {2692#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {2692#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {2693#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2694#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {2694#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {2686#false} havoc ~i~0;~i~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {2686#false} ~i~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {2686#false} havoc ~x~0;~x~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {2686#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2686#false} is VALID [2018-11-23 11:51:58,411 INFO L256 TraceCheckUtils]: 47: Hoare triple {2686#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2686#false} is VALID [2018-11-23 11:51:58,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {2686#false} ~cond := #in~cond; {2686#false} is VALID [2018-11-23 11:51:58,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {2686#false} assume 0 == ~cond; {2686#false} is VALID [2018-11-23 11:51:58,412 INFO L273 TraceCheckUtils]: 50: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2018-11-23 11:51:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:51:58,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:58,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2685#true} is VALID [2018-11-23 11:51:58,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {2685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2685#true} is VALID [2018-11-23 11:51:58,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2018-11-23 11:51:58,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #77#return; {2685#true} is VALID [2018-11-23 11:51:58,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret10 := main(); {2685#true} is VALID [2018-11-23 11:51:58,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {2685#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2713#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:58,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {2713#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2713#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:58,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {2713#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {2688#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2688#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {2689#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2689#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {2689#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {2690#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2690#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {2690#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {2691#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2691#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {2691#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {2692#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2692#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {2692#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {2693#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2693#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2694#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {2694#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {2686#false} havoc ~i~0;~i~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2686#false} is VALID [2018-11-23 11:51:58,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {2686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2686#false} is VALID [2018-11-23 11:51:58,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {2686#false} ~i~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 37: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 39: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {2686#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {2686#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {2686#false} assume !(~i~0 < 100000); {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {2686#false} havoc ~x~0;~x~0 := 0; {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {2686#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L256 TraceCheckUtils]: 47: Hoare triple {2686#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {2686#false} ~cond := #in~cond; {2686#false} is VALID [2018-11-23 11:51:58,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {2686#false} assume 0 == ~cond; {2686#false} is VALID [2018-11-23 11:51:58,838 INFO L273 TraceCheckUtils]: 50: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2018-11-23 11:51:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:51:58,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:58,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:51:58,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-23 11:51:58,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:58,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:58,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:58,899 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 11 states. [2018-11-23 11:51:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,186 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 11:51:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:51:59,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-23 11:51:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 11:51:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2018-11-23 11:51:59,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 64 transitions. [2018-11-23 11:51:59,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,301 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:51:59,301 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:51:59,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:51:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 11:51:59,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:59,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:59,346 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:59,346 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 11:51:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,347 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:51:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:51:59,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,348 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:59,348 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 11:51:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,350 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 11:51:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 11:51:59,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:59,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:51:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 11:51:59,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2018-11-23 11:51:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:59,352 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 11:51:59,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 11:51:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:51:59,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:59,354 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:59,354 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:59,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1025272074, now seen corresponding path program 8 times [2018-11-23 11:51:59,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:59,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 11:51:59,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 11:51:59,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 11:51:59,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #77#return; {3189#true} is VALID [2018-11-23 11:51:59,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret10 := main(); {3189#true} is VALID [2018-11-23 11:51:59,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3191#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {3191#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3191#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {3191#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {3198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3199#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:59,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {3199#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {3190#false} havoc ~i~0;~i~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} ~i~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,651 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L256 TraceCheckUtils]: 49: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 11:51:59,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume 0 == ~cond; {3190#false} is VALID [2018-11-23 11:51:59,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 11:51:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:51:59,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:59,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:59,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:59,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:59,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 11:51:59,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 11:51:59,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 11:51:59,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #77#return; {3189#true} is VALID [2018-11-23 11:51:59,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret10 := main(); {3189#true} is VALID [2018-11-23 11:51:59,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3218#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:59,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {3218#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3218#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:59,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {3218#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3192#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3193#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3194#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3195#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3196#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3197#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3198#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {3198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3199#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:59,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {3199#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {3190#false} havoc ~i~0;~i~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3190#false} is VALID [2018-11-23 11:51:59,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3190#false} is VALID [2018-11-23 11:51:59,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} ~i~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,860 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,860 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,861 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3190#false} is VALID [2018-11-23 11:51:59,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3190#false} is VALID [2018-11-23 11:51:59,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 100000); {3190#false} is VALID [2018-11-23 11:51:59,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0; {3190#false} is VALID [2018-11-23 11:51:59,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3190#false} is VALID [2018-11-23 11:51:59,862 INFO L256 TraceCheckUtils]: 49: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3190#false} is VALID [2018-11-23 11:51:59,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 11:51:59,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume 0 == ~cond; {3190#false} is VALID [2018-11-23 11:51:59,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 11:51:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:51:59,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:51:59,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:51:59,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:59,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,923 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 12 states. [2018-11-23 11:52:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,172 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-23 11:52:00,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:00,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 11:52:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 11:52:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 11:52:00,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2018-11-23 11:52:00,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,267 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:52:00,267 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:52:00,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:52:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 11:52:00,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 11:52:00,291 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 11:52:00,291 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 11:52:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,293 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:52:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:52:00,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,294 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 11:52:00,294 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 11:52:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,295 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:52:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:52:00,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:52:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-23 11:52:00,298 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 53 [2018-11-23 11:52:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,299 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-23 11:52:00,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-23 11:52:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:00,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,300 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:00,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 303536916, now seen corresponding path program 9 times [2018-11-23 11:52:00,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2018-11-23 11:52:00,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3710#true} is VALID [2018-11-23 11:52:00,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2018-11-23 11:52:00,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #77#return; {3710#true} is VALID [2018-11-23 11:52:00,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret10 := main(); {3710#true} is VALID [2018-11-23 11:52:00,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {3710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3712#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {3712#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3712#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {3712#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3713#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {3713#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3713#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {3713#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3714#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {3714#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3714#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {3714#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3715#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {3715#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3715#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {3715#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {3716#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3717#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3717#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {3717#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3718#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {3718#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3718#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {3718#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3719#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {3719#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3719#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {3719#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3720#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {3720#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3720#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3720#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3721#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:00,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {3721#(<= main_~a~0 9)} assume !(~a~0 < 100000); {3711#false} is VALID [2018-11-23 11:52:00,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {3711#false} havoc ~i~0;~i~0 := 0; {3711#false} is VALID [2018-11-23 11:52:00,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3711#false} is VALID [2018-11-23 11:52:00,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {3711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3711#false} is VALID [2018-11-23 11:52:00,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3711#false} is VALID [2018-11-23 11:52:00,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {3711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3711#false} is VALID [2018-11-23 11:52:00,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3711#false} is VALID [2018-11-23 11:52:00,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {3711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3711#false} is VALID [2018-11-23 11:52:00,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3711#false} is VALID [2018-11-23 11:52:00,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {3711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3711#false} is VALID [2018-11-23 11:52:00,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3711#false} is VALID [2018-11-23 11:52:00,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {3711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3711#false} is VALID [2018-11-23 11:52:00,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {3711#false} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:52:00,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {3711#false} ~i~0 := 0; {3711#false} is VALID [2018-11-23 11:52:00,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3711#false} is VALID [2018-11-23 11:52:00,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {3711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3711#false} is VALID [2018-11-23 11:52:00,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3711#false} is VALID [2018-11-23 11:52:00,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {3711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {3711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {3711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {3711#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3711#false} is VALID [2018-11-23 11:52:00,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {3711#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {3711#false} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {3711#false} havoc ~x~0;~x~0 := 0; {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 50: Hoare triple {3711#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L256 TraceCheckUtils]: 51: Hoare triple {3711#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {3711#false} ~cond := #in~cond; {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {3711#false} assume 0 == ~cond; {3711#false} is VALID [2018-11-23 11:52:00,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2018-11-23 11:52:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:52:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:00,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:01,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:52:01,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2018-11-23 11:52:01,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3710#true} is VALID [2018-11-23 11:52:01,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2018-11-23 11:52:01,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #77#return; {3710#true} is VALID [2018-11-23 11:52:01,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret10 := main(); {3710#true} is VALID [2018-11-23 11:52:01,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {3710#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3710#true} is VALID [2018-11-23 11:52:01,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {3710#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {3710#true} assume !(~a~0 < 100000); {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {3710#true} havoc ~i~0;~i~0 := 0; {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {3710#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3710#true} is VALID [2018-11-23 11:52:01,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {3710#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {3710#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {3710#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3710#true} is VALID [2018-11-23 11:52:01,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {3710#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3710#true} is VALID [2018-11-23 11:52:01,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {3710#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3710#true} is VALID [2018-11-23 11:52:01,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {3710#true} assume !(~i~0 < 100000); {3710#true} is VALID [2018-11-23 11:52:01,359 INFO L273 TraceCheckUtils]: 37: Hoare triple {3710#true} ~i~0 := 0; {3836#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {3836#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3836#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {3836#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3843#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {3843#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3843#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {3843#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3850#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {3850#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3850#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {3850#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3857#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {3857#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3857#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,368 INFO L273 TraceCheckUtils]: 45: Hoare triple {3857#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3864#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {3864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3864#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,369 INFO L273 TraceCheckUtils]: 47: Hoare triple {3864#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3871#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:01,369 INFO L273 TraceCheckUtils]: 48: Hoare triple {3871#(<= main_~i~0 5)} assume !(~i~0 < 100000); {3711#false} is VALID [2018-11-23 11:52:01,369 INFO L273 TraceCheckUtils]: 49: Hoare triple {3711#false} havoc ~x~0;~x~0 := 0; {3711#false} is VALID [2018-11-23 11:52:01,369 INFO L273 TraceCheckUtils]: 50: Hoare triple {3711#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {3711#false} is VALID [2018-11-23 11:52:01,370 INFO L256 TraceCheckUtils]: 51: Hoare triple {3711#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {3711#false} is VALID [2018-11-23 11:52:01,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {3711#false} ~cond := #in~cond; {3711#false} is VALID [2018-11-23 11:52:01,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {3711#false} assume 0 == ~cond; {3711#false} is VALID [2018-11-23 11:52:01,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2018-11-23 11:52:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-23 11:52:01,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:52:01,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:52:01,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:01,455 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 11:52:01,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:01,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:01,457 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2018-11-23 11:52:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,147 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 11:52:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:02,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:52:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2018-11-23 11:52:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2018-11-23 11:52:02,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2018-11-23 11:52:02,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,262 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:52:02,263 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:52:02,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:52:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 11:52:02,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-23 11:52:02,303 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-23 11:52:02,303 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-23 11:52:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,305 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:52:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:52:02,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,306 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-23 11:52:02,306 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-23 11:52:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,308 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:52:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:52:02,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:52:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-23 11:52:02,310 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-11-23 11:52:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,310 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-23 11:52:02,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-23 11:52:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:52:02,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,312 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:02,312 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -169428562, now seen corresponding path program 10 times [2018-11-23 11:52:02,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {4279#true} call ULTIMATE.init(); {4279#true} is VALID [2018-11-23 11:52:02,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {4279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4279#true} is VALID [2018-11-23 11:52:02,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {4279#true} assume true; {4279#true} is VALID [2018-11-23 11:52:02,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4279#true} {4279#true} #77#return; {4279#true} is VALID [2018-11-23 11:52:02,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {4279#true} call #t~ret10 := main(); {4279#true} is VALID [2018-11-23 11:52:02,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {4279#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4281#(= main_~a~0 0)} is VALID [2018-11-23 11:52:03,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {4281#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4281#(= main_~a~0 0)} is VALID [2018-11-23 11:52:03,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {4281#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,101 INFO L273 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:03,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:03,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:03,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:03,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4291#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {4280#false} havoc ~i~0;~i~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,109 INFO L273 TraceCheckUtils]: 31: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,110 INFO L273 TraceCheckUtils]: 37: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {4280#false} ~i~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 43: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,111 INFO L273 TraceCheckUtils]: 44: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 45: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 49: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,112 INFO L273 TraceCheckUtils]: 50: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 52: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 53: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 54: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 55: Hoare triple {4280#false} havoc ~x~0;~x~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {4280#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4280#false} is VALID [2018-11-23 11:52:03,113 INFO L256 TraceCheckUtils]: 57: Hoare triple {4280#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4280#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {4280#false} ~cond := #in~cond; {4280#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 59: Hoare triple {4280#false} assume 0 == ~cond; {4280#false} is VALID [2018-11-23 11:52:03,114 INFO L273 TraceCheckUtils]: 60: Hoare triple {4280#false} assume !false; {4280#false} is VALID [2018-11-23 11:52:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:03,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:03,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:03,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:03,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:03,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:03,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {4279#true} call ULTIMATE.init(); {4279#true} is VALID [2018-11-23 11:52:03,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {4279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4279#true} is VALID [2018-11-23 11:52:03,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {4279#true} assume true; {4279#true} is VALID [2018-11-23 11:52:03,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4279#true} {4279#true} #77#return; {4279#true} is VALID [2018-11-23 11:52:03,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {4279#true} call #t~ret10 := main(); {4279#true} is VALID [2018-11-23 11:52:03,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {4279#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4310#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:03,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {4310#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4310#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:03,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {4310#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4282#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4283#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4284#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4285#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4286#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4287#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4288#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:03,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4289#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:03,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:03,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4290#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:03,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4291#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:03,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {4280#false} havoc ~i~0;~i~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,490 INFO L273 TraceCheckUtils]: 32: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,490 INFO L273 TraceCheckUtils]: 33: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,491 INFO L273 TraceCheckUtils]: 38: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4280#false} is VALID [2018-11-23 11:52:03,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {4280#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4280#false} is VALID [2018-11-23 11:52:03,492 INFO L273 TraceCheckUtils]: 40: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {4280#false} ~i~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,492 INFO L273 TraceCheckUtils]: 43: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,492 INFO L273 TraceCheckUtils]: 44: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,493 INFO L273 TraceCheckUtils]: 50: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 52: Hoare triple {4280#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 53: Hoare triple {4280#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 54: Hoare triple {4280#false} assume !(~i~0 < 100000); {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 55: Hoare triple {4280#false} havoc ~x~0;~x~0 := 0; {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {4280#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L256 TraceCheckUtils]: 57: Hoare triple {4280#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4280#false} is VALID [2018-11-23 11:52:03,494 INFO L273 TraceCheckUtils]: 58: Hoare triple {4280#false} ~cond := #in~cond; {4280#false} is VALID [2018-11-23 11:52:03,495 INFO L273 TraceCheckUtils]: 59: Hoare triple {4280#false} assume 0 == ~cond; {4280#false} is VALID [2018-11-23 11:52:03,495 INFO L273 TraceCheckUtils]: 60: Hoare triple {4280#false} assume !false; {4280#false} is VALID [2018-11-23 11:52:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:03,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:52:03,519 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-23 11:52:03,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:03,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:03,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:03,610 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 14 states. [2018-11-23 11:52:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,988 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-23 11:52:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:03,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-23 11:52:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-23 11:52:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2018-11-23 11:52:03,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 70 transitions. [2018-11-23 11:52:04,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:04,078 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:52:04,078 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:52:04,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:52:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-23 11:52:04,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:04,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-23 11:52:04,106 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-23 11:52:04,106 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-23 11:52:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,108 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:52:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:52:04,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,109 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-23 11:52:04,109 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-23 11:52:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,111 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 11:52:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 11:52:04,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:04,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:52:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-23 11:52:04,113 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 61 [2018-11-23 11:52:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:04,114 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-23 11:52:04,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-23 11:52:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:52:04,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:04,115 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:04,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:04,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697740, now seen corresponding path program 11 times [2018-11-23 11:52:04,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {4872#true} call ULTIMATE.init(); {4872#true} is VALID [2018-11-23 11:52:05,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {4872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4872#true} is VALID [2018-11-23 11:52:05,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {4872#true} assume true; {4872#true} is VALID [2018-11-23 11:52:05,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4872#true} {4872#true} #77#return; {4872#true} is VALID [2018-11-23 11:52:05,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {4872#true} call #t~ret10 := main(); {4872#true} is VALID [2018-11-23 11:52:05,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {4872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4874#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {4874#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4874#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {4874#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {4875#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {4875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {4876#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {4876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {4877#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {4877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {4878#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {4878#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {4879#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {4879#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {4880#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {4880#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {4881#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {4881#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {4882#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {4882#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:05,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {4883#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:05,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {4883#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:05,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {4884#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:05,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {4884#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4885#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:05,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {4885#(<= main_~a~0 11)} assume !(~a~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:05,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {4873#false} havoc ~i~0;~i~0 := 0; {4873#false} is VALID [2018-11-23 11:52:05,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:05,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:05,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:05,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {4873#false} ~i~0 := 0; {4873#false} is VALID [2018-11-23 11:52:05,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {4873#false} havoc ~x~0;~x~0 := 0; {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {4873#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L256 TraceCheckUtils]: 59: Hoare triple {4873#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4873#false} is VALID [2018-11-23 11:52:05,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {4873#false} ~cond := #in~cond; {4873#false} is VALID [2018-11-23 11:52:05,808 INFO L273 TraceCheckUtils]: 61: Hoare triple {4873#false} assume 0 == ~cond; {4873#false} is VALID [2018-11-23 11:52:05,808 INFO L273 TraceCheckUtils]: 62: Hoare triple {4873#false} assume !false; {4873#false} is VALID [2018-11-23 11:52:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:05,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:36,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:52:36,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:36,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {4872#true} call ULTIMATE.init(); {4872#true} is VALID [2018-11-23 11:52:36,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {4872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4872#true} is VALID [2018-11-23 11:52:36,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {4872#true} assume true; {4872#true} is VALID [2018-11-23 11:52:36,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4872#true} {4872#true} #77#return; {4872#true} is VALID [2018-11-23 11:52:36,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {4872#true} call #t~ret10 := main(); {4872#true} is VALID [2018-11-23 11:52:36,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {4872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4904#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:36,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {4904#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4904#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:36,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {4904#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:36,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {4875#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4875#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:36,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {4875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:36,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {4876#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4876#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:36,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {4876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:36,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {4877#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4877#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:36,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {4877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:36,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {4878#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4878#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:36,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {4878#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:36,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {4879#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4879#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:36,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {4879#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:36,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {4880#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4880#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:36,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {4880#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:36,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {4881#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4881#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:36,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {4881#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:36,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {4882#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4882#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:36,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {4882#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:36,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {4883#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4883#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:36,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {4883#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:36,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {4884#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4884#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:36,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {4884#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4885#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:36,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {4885#(<= main_~a~0 11)} assume !(~a~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:36,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {4873#false} havoc ~i~0;~i~0 := 0; {4873#false} is VALID [2018-11-23 11:52:36,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4873#false} is VALID [2018-11-23 11:52:36,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {4873#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4873#false} is VALID [2018-11-23 11:52:36,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:36,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {4873#false} ~i~0 := 0; {4873#false} is VALID [2018-11-23 11:52:36,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,281 INFO L273 TraceCheckUtils]: 45: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {4873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {4873#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {4873#false} assume !(~i~0 < 100000); {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {4873#false} havoc ~x~0;~x~0 := 0; {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {4873#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L256 TraceCheckUtils]: 59: Hoare triple {4873#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {4873#false} is VALID [2018-11-23 11:52:36,283 INFO L273 TraceCheckUtils]: 60: Hoare triple {4873#false} ~cond := #in~cond; {4873#false} is VALID [2018-11-23 11:52:36,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {4873#false} assume 0 == ~cond; {4873#false} is VALID [2018-11-23 11:52:36,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {4873#false} assume !false; {4873#false} is VALID [2018-11-23 11:52:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:36,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:52:36,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 11:52:36,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:36,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:52:36,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:52:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:52:36,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:36,359 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 15 states. [2018-11-23 11:52:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:36,827 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-11-23 11:52:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:36,827 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 11:52:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2018-11-23 11:52:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2018-11-23 11:52:36,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 72 transitions. [2018-11-23 11:52:37,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:37,298 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:52:37,298 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:52:37,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:52:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 11:52:37,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:37,336 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:37,336 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,337 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-23 11:52:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-23 11:52:37,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,338 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:37,338 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,339 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-23 11:52:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-23 11:52:37,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:52:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-23 11:52:37,342 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2018-11-23 11:52:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,342 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-23 11:52:37,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:52:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 11:52:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:37,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,343 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:37,344 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 648525418, now seen corresponding path program 12 times [2018-11-23 11:52:37,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:38,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2018-11-23 11:52:38,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5482#true} is VALID [2018-11-23 11:52:38,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2018-11-23 11:52:38,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #77#return; {5482#true} is VALID [2018-11-23 11:52:38,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret10 := main(); {5482#true} is VALID [2018-11-23 11:52:38,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {5482#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5484#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {5484#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5484#(= main_~a~0 0)} is VALID [2018-11-23 11:52:38,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {5484#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5485#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {5485#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5485#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:38,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {5485#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5486#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {5486#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5486#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:38,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {5486#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5487#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {5487#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5487#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:38,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {5487#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5488#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {5488#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5488#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:38,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {5488#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5489#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {5489#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5489#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:38,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {5489#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5490#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {5490#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5490#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:38,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {5490#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5491#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {5491#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5491#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:38,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {5491#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5492#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {5492#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5492#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:38,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {5492#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5493#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:38,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {5493#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5493#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:38,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {5493#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5494#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:38,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5494#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:38,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {5494#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5495#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:38,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {5495#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5495#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:38,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {5495#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5496#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:38,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {5496#(<= main_~a~0 12)} assume !(~a~0 < 100000); {5483#false} is VALID [2018-11-23 11:52:38,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {5483#false} havoc ~i~0;~i~0 := 0; {5483#false} is VALID [2018-11-23 11:52:38,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {5483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {5483#false} assume !(~i~0 < 100000); {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {5483#false} ~i~0 := 0; {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 52: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,758 INFO L273 TraceCheckUtils]: 54: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 55: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 56: Hoare triple {5483#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {5483#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {5483#false} assume !(~i~0 < 100000); {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 59: Hoare triple {5483#false} havoc ~x~0;~x~0 := 0; {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L273 TraceCheckUtils]: 60: Hoare triple {5483#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5483#false} is VALID [2018-11-23 11:52:38,759 INFO L256 TraceCheckUtils]: 61: Hoare triple {5483#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {5483#false} is VALID [2018-11-23 11:52:38,760 INFO L273 TraceCheckUtils]: 62: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2018-11-23 11:52:38,760 INFO L273 TraceCheckUtils]: 63: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2018-11-23 11:52:38,760 INFO L273 TraceCheckUtils]: 64: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2018-11-23 11:52:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:52:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:38,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:38,771 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:46,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:52:46,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:46,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:47,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2018-11-23 11:52:47,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5482#true} is VALID [2018-11-23 11:52:47,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2018-11-23 11:52:47,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #77#return; {5482#true} is VALID [2018-11-23 11:52:47,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret10 := main(); {5482#true} is VALID [2018-11-23 11:52:47,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {5482#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5482#true} is VALID [2018-11-23 11:52:47,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {5482#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {5482#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {5482#true} assume !(~a~0 < 100000); {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {5482#true} havoc ~i~0;~i~0 := 0; {5482#true} is VALID [2018-11-23 11:52:47,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {5482#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {5482#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {5482#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {5482#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5482#true} is VALID [2018-11-23 11:52:47,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5482#true} is VALID [2018-11-23 11:52:47,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {5482#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5482#true} is VALID [2018-11-23 11:52:47,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {5482#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5626#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:47,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {5626#(< main_~i~0 100000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5630#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:47,062 INFO L273 TraceCheckUtils]: 44: Hoare triple {5630#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5482#true} is VALID [2018-11-23 11:52:47,062 INFO L273 TraceCheckUtils]: 45: Hoare triple {5482#true} ~i~0 := 0; {5637#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:47,062 INFO L273 TraceCheckUtils]: 46: Hoare triple {5637#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5637#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:47,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {5637#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5644#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:47,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {5644#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5644#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:47,064 INFO L273 TraceCheckUtils]: 49: Hoare triple {5644#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5651#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,064 INFO L273 TraceCheckUtils]: 50: Hoare triple {5651#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5651#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,065 INFO L273 TraceCheckUtils]: 51: Hoare triple {5651#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5658#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {5658#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5658#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,066 INFO L273 TraceCheckUtils]: 53: Hoare triple {5658#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5665#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,067 INFO L273 TraceCheckUtils]: 54: Hoare triple {5665#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5665#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,068 INFO L273 TraceCheckUtils]: 55: Hoare triple {5665#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5672#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,068 INFO L273 TraceCheckUtils]: 56: Hoare triple {5672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5672#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,069 INFO L273 TraceCheckUtils]: 57: Hoare triple {5672#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5679#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,069 INFO L273 TraceCheckUtils]: 58: Hoare triple {5679#(<= main_~i~0 6)} assume !(~i~0 < 100000); {5483#false} is VALID [2018-11-23 11:52:47,070 INFO L273 TraceCheckUtils]: 59: Hoare triple {5483#false} havoc ~x~0;~x~0 := 0; {5483#false} is VALID [2018-11-23 11:52:47,070 INFO L273 TraceCheckUtils]: 60: Hoare triple {5483#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {5483#false} is VALID [2018-11-23 11:52:47,070 INFO L256 TraceCheckUtils]: 61: Hoare triple {5483#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {5483#false} is VALID [2018-11-23 11:52:47,070 INFO L273 TraceCheckUtils]: 62: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2018-11-23 11:52:47,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2018-11-23 11:52:47,071 INFO L273 TraceCheckUtils]: 64: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2018-11-23 11:52:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 11:52:47,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:47,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-23 11:52:47,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-11-23 11:52:47,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:47,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:47,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:47,161 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 24 states. [2018-11-23 11:52:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:48,040 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-11-23 11:52:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:52:48,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-11-23 11:52:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2018-11-23 11:52:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2018-11-23 11:52:48,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 108 transitions. [2018-11-23 11:52:48,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:48,168 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:52:48,168 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:52:48,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:52:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 11:52:48,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:48,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:48,209 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:48,209 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:48,213 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-23 11:52:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-23 11:52:48,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:48,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:48,213 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 11:52:48,214 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 11:52:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:48,215 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-23 11:52:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-23 11:52:48,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:48,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:48,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:48,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:52:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-23 11:52:48,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 65 [2018-11-23 11:52:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:48,218 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-23 11:52:48,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-23 11:52:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:52:48,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:48,219 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:48,219 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:48,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1692070528, now seen corresponding path program 13 times [2018-11-23 11:52:48,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:48,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:48,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {6157#true} call ULTIMATE.init(); {6157#true} is VALID [2018-11-23 11:52:48,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {6157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6157#true} is VALID [2018-11-23 11:52:48,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {6157#true} assume true; {6157#true} is VALID [2018-11-23 11:52:48,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6157#true} {6157#true} #77#return; {6157#true} is VALID [2018-11-23 11:52:48,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {6157#true} call #t~ret10 := main(); {6157#true} is VALID [2018-11-23 11:52:48,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {6157#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6159#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {6159#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6159#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {6159#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {6160#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6160#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {6160#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {6161#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6161#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {6161#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6162#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {6162#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6162#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {6162#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6163#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {6163#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6163#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {6163#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6164#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {6164#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6164#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {6164#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6165#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {6165#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6165#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {6165#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6166#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {6166#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6166#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {6166#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6167#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {6167#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6167#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {6167#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6168#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,853 INFO L273 TraceCheckUtils]: 24: Hoare triple {6168#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6168#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {6168#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6169#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:48,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {6169#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6169#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:48,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {6169#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6170#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:48,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {6170#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6170#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:48,856 INFO L273 TraceCheckUtils]: 29: Hoare triple {6170#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6171#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:48,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {6171#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6171#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:48,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {6171#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6172#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:48,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {6172#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:48,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {6158#false} havoc ~i~0;~i~0 := 0; {6158#false} is VALID [2018-11-23 11:52:48,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {6158#false} assume !(~i~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {6158#false} ~i~0 := 0; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 53: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 54: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 57: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 59: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 60: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 61: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 62: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 63: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 64: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 66: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 67: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {6158#false} assume !(~i~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {6158#false} havoc ~x~0;~x~0 := 0; {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 70: Hoare triple {6158#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L256 TraceCheckUtils]: 71: Hoare triple {6158#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 72: Hoare triple {6158#false} ~cond := #in~cond; {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 73: Hoare triple {6158#false} assume 0 == ~cond; {6158#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 74: Hoare triple {6158#false} assume !false; {6158#false} is VALID [2018-11-23 11:52:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:48,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:48,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:48,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:49,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {6157#true} call ULTIMATE.init(); {6157#true} is VALID [2018-11-23 11:52:49,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {6157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6157#true} is VALID [2018-11-23 11:52:49,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {6157#true} assume true; {6157#true} is VALID [2018-11-23 11:52:49,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6157#true} {6157#true} #77#return; {6157#true} is VALID [2018-11-23 11:52:49,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {6157#true} call #t~ret10 := main(); {6157#true} is VALID [2018-11-23 11:52:49,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {6157#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6191#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:49,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {6191#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6191#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:49,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {6191#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:49,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {6160#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6160#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:49,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {6160#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:49,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {6161#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6161#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:49,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {6161#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6162#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:49,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {6162#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6162#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:49,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {6162#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6163#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:49,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {6163#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6163#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:49,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {6163#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6164#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:49,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {6164#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6164#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:49,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {6164#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6165#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:49,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {6165#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6165#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:49,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {6165#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6166#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:49,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {6166#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6166#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:49,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {6166#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6167#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:49,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {6167#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6167#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:49,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {6167#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6168#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:49,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {6168#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6168#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:49,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {6168#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6169#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:49,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {6169#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6169#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:49,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {6169#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6170#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:49,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {6170#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6170#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:49,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {6170#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6171#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:49,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {6171#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6171#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:49,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {6171#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6172#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {6172#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {6158#false} havoc ~i~0;~i~0 := 0; {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 47: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 48: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 49: Hoare triple {6158#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 50: Hoare triple {6158#false} assume !(~i~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 51: Hoare triple {6158#false} ~i~0 := 0; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 56: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 57: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 62: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 64: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {6158#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {6158#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 68: Hoare triple {6158#false} assume !(~i~0 < 100000); {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {6158#false} havoc ~x~0;~x~0 := 0; {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {6158#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L256 TraceCheckUtils]: 71: Hoare triple {6158#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6158#false} is VALID [2018-11-23 11:52:49,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {6158#false} ~cond := #in~cond; {6158#false} is VALID [2018-11-23 11:52:49,277 INFO L273 TraceCheckUtils]: 73: Hoare triple {6158#false} assume 0 == ~cond; {6158#false} is VALID [2018-11-23 11:52:49,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {6158#false} assume !false; {6158#false} is VALID [2018-11-23 11:52:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:49,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:49,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:52:49,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-23 11:52:49,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:49,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:52:49,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:52:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:52:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:49,378 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 17 states. [2018-11-23 11:52:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,814 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:52:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:49,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-23 11:52:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-23 11:52:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2018-11-23 11:52:49,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2018-11-23 11:52:49,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:49,902 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:52:49,903 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:52:49,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:52:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 11:52:50,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:50,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:50,017 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:50,017 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,019 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:52:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:52:50,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:50,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:50,019 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 11:52:50,020 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 11:52:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,021 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-11-23 11:52:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-23 11:52:50,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:50,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:50,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:50,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:52:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 11:52:50,024 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 75 [2018-11-23 11:52:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:50,024 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 11:52:50,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:52:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:52:50,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:50,025 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:50,026 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:50,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:50,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1133381406, now seen corresponding path program 14 times [2018-11-23 11:52:50,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:50,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:50,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:50,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {6877#true} call ULTIMATE.init(); {6877#true} is VALID [2018-11-23 11:52:50,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {6877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6877#true} is VALID [2018-11-23 11:52:50,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {6877#true} assume true; {6877#true} is VALID [2018-11-23 11:52:50,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6877#true} {6877#true} #77#return; {6877#true} is VALID [2018-11-23 11:52:50,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {6877#true} call #t~ret10 := main(); {6877#true} is VALID [2018-11-23 11:52:50,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {6877#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6879#(= main_~a~0 0)} is VALID [2018-11-23 11:52:50,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {6879#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6879#(= main_~a~0 0)} is VALID [2018-11-23 11:52:50,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {6879#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6880#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:50,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {6880#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6880#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:50,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {6880#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6881#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:50,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {6881#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6881#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:50,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {6881#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6882#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:50,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {6882#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6882#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:50,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {6882#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6883#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:50,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {6883#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6883#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:50,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {6883#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6884#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:50,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {6884#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6884#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:50,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {6884#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6885#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:50,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {6885#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6885#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:50,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {6885#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6886#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:50,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {6886#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6886#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:50,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {6886#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6887#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:50,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {6887#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6887#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:50,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {6887#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6888#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:50,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {6888#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6888#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:50,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {6888#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6889#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:50,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {6889#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6889#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:50,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {6889#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6890#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:50,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {6890#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6890#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:50,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {6890#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6891#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:50,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {6891#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6891#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:50,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {6891#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6892#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:50,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {6892#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6892#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:50,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {6892#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6893#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:50,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {6893#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {6878#false} havoc ~i~0;~i~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,414 INFO L273 TraceCheckUtils]: 51: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {6878#false} assume !(~i~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {6878#false} ~i~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,415 INFO L273 TraceCheckUtils]: 55: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,415 INFO L273 TraceCheckUtils]: 56: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,416 INFO L273 TraceCheckUtils]: 59: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,416 INFO L273 TraceCheckUtils]: 60: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,416 INFO L273 TraceCheckUtils]: 61: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,416 INFO L273 TraceCheckUtils]: 63: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,417 INFO L273 TraceCheckUtils]: 65: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,417 INFO L273 TraceCheckUtils]: 66: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,417 INFO L273 TraceCheckUtils]: 67: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,417 INFO L273 TraceCheckUtils]: 68: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,418 INFO L273 TraceCheckUtils]: 70: Hoare triple {6878#false} assume !(~i~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,418 INFO L273 TraceCheckUtils]: 71: Hoare triple {6878#false} havoc ~x~0;~x~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,418 INFO L273 TraceCheckUtils]: 72: Hoare triple {6878#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6878#false} is VALID [2018-11-23 11:52:50,418 INFO L256 TraceCheckUtils]: 73: Hoare triple {6878#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6878#false} is VALID [2018-11-23 11:52:50,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {6878#false} ~cond := #in~cond; {6878#false} is VALID [2018-11-23 11:52:50,419 INFO L273 TraceCheckUtils]: 75: Hoare triple {6878#false} assume 0 == ~cond; {6878#false} is VALID [2018-11-23 11:52:50,419 INFO L273 TraceCheckUtils]: 76: Hoare triple {6878#false} assume !false; {6878#false} is VALID [2018-11-23 11:52:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:50,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:50,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:50,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:50,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:50,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {6877#true} call ULTIMATE.init(); {6877#true} is VALID [2018-11-23 11:52:50,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {6877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6877#true} is VALID [2018-11-23 11:52:50,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {6877#true} assume true; {6877#true} is VALID [2018-11-23 11:52:50,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6877#true} {6877#true} #77#return; {6877#true} is VALID [2018-11-23 11:52:50,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {6877#true} call #t~ret10 := main(); {6877#true} is VALID [2018-11-23 11:52:50,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {6877#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6912#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:50,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {6912#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6912#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:50,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {6912#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6880#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:50,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {6880#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6880#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:50,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {6880#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6881#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:50,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {6881#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6881#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:50,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {6881#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6882#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:50,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {6882#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6882#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:50,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {6882#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6883#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:50,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {6883#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6883#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:50,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {6883#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6884#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:50,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {6884#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6884#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:50,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {6884#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6885#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:50,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {6885#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6885#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:50,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {6885#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6886#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:50,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {6886#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6886#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:50,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {6886#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6887#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:50,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {6887#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6887#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:50,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {6887#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6888#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:50,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {6888#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6888#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:50,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {6888#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6889#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:50,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {6889#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6889#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:50,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {6889#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6890#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:50,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {6890#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6890#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:50,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {6890#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6891#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:50,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {6891#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6891#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:50,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {6891#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6892#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:50,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {6892#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6892#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:50,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {6892#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6893#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:50,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {6893#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {6878#false} havoc ~i~0;~i~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,718 INFO L273 TraceCheckUtils]: 47: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,718 INFO L273 TraceCheckUtils]: 48: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,718 INFO L273 TraceCheckUtils]: 49: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {6878#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 52: Hoare triple {6878#false} assume !(~i~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 53: Hoare triple {6878#false} ~i~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 54: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 58: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 60: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 66: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 67: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 68: Hoare triple {6878#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6878#false} is VALID [2018-11-23 11:52:50,721 INFO L273 TraceCheckUtils]: 69: Hoare triple {6878#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 70: Hoare triple {6878#false} assume !(~i~0 < 100000); {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 71: Hoare triple {6878#false} havoc ~x~0;~x~0 := 0; {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 72: Hoare triple {6878#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L256 TraceCheckUtils]: 73: Hoare triple {6878#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {6878#false} ~cond := #in~cond; {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 75: Hoare triple {6878#false} assume 0 == ~cond; {6878#false} is VALID [2018-11-23 11:52:50,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {6878#false} assume !false; {6878#false} is VALID [2018-11-23 11:52:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:52:50,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:52:50,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:50,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:50,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:50,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:50,834 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 18 states. [2018-11-23 11:52:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,419 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-11-23 11:52:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:51,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-23 11:52:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2018-11-23 11:52:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2018-11-23 11:52:51,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2018-11-23 11:52:51,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:51,501 INFO L225 Difference]: With dead ends: 132 [2018-11-23 11:52:51,501 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:51,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:52:51,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:51,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:51,635 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:51,635 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,637 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:52:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:52:51,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,638 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:51,638 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,639 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:52:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:52:51,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:51,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:52:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-11-23 11:52:51,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 77 [2018-11-23 11:52:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:51,642 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-11-23 11:52:51,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 11:52:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:51,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:51,643 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:51,643 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:51,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1973358908, now seen corresponding path program 15 times [2018-11-23 11:52:51,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:52,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {7614#true} call ULTIMATE.init(); {7614#true} is VALID [2018-11-23 11:52:52,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {7614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7614#true} is VALID [2018-11-23 11:52:52,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {7614#true} assume true; {7614#true} is VALID [2018-11-23 11:52:52,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7614#true} {7614#true} #77#return; {7614#true} is VALID [2018-11-23 11:52:52,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {7614#true} call #t~ret10 := main(); {7614#true} is VALID [2018-11-23 11:52:52,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {7614#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7616#(= main_~a~0 0)} is VALID [2018-11-23 11:52:52,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {7616#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7616#(= main_~a~0 0)} is VALID [2018-11-23 11:52:52,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {7616#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7617#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:52,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {7617#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7617#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:52,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {7617#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7618#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:52,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {7618#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7618#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:52,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {7618#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7619#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:52,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {7619#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7619#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:52,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {7619#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7620#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:52,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {7620#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7620#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:52,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {7620#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7621#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:52,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {7621#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7621#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:52,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {7621#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7622#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:52,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {7622#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7622#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:52,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {7622#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7623#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:52,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {7623#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7623#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:52,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {7623#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7624#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:52,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {7624#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7624#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:52,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {7624#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7625#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:52,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {7625#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7625#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:52,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {7625#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7626#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:52,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {7626#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7626#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:52,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {7626#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7627#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:52,487 INFO L273 TraceCheckUtils]: 28: Hoare triple {7627#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7627#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:52,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {7627#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7628#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:52,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {7628#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7628#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:52,489 INFO L273 TraceCheckUtils]: 31: Hoare triple {7628#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7629#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:52,490 INFO L273 TraceCheckUtils]: 32: Hoare triple {7629#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7629#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:52,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {7629#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7630#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:52,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {7630#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7630#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:52,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {7630#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7631#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:52,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {7631#(<= main_~a~0 15)} assume !(~a~0 < 100000); {7615#false} is VALID [2018-11-23 11:52:52,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {7615#false} havoc ~i~0;~i~0 := 0; {7615#false} is VALID [2018-11-23 11:52:52,493 INFO L273 TraceCheckUtils]: 38: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,495 INFO L273 TraceCheckUtils]: 46: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,495 INFO L273 TraceCheckUtils]: 49: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,496 INFO L273 TraceCheckUtils]: 50: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,496 INFO L273 TraceCheckUtils]: 52: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#false} is VALID [2018-11-23 11:52:52,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {7615#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#false} is VALID [2018-11-23 11:52:52,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {7615#false} assume !(~i~0 < 100000); {7615#false} is VALID [2018-11-23 11:52:52,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {7615#false} ~i~0 := 0; {7615#false} is VALID [2018-11-23 11:52:52,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,497 INFO L273 TraceCheckUtils]: 57: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,497 INFO L273 TraceCheckUtils]: 59: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 63: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 64: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 66: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,498 INFO L273 TraceCheckUtils]: 67: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 69: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 72: Hoare triple {7615#false} assume !(~i~0 < 100000); {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 73: Hoare triple {7615#false} havoc ~x~0;~x~0 := 0; {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L273 TraceCheckUtils]: 74: Hoare triple {7615#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7615#false} is VALID [2018-11-23 11:52:52,499 INFO L256 TraceCheckUtils]: 75: Hoare triple {7615#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {7615#false} is VALID [2018-11-23 11:52:52,500 INFO L273 TraceCheckUtils]: 76: Hoare triple {7615#false} ~cond := #in~cond; {7615#false} is VALID [2018-11-23 11:52:52,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {7615#false} assume 0 == ~cond; {7615#false} is VALID [2018-11-23 11:52:52,500 INFO L273 TraceCheckUtils]: 78: Hoare triple {7615#false} assume !false; {7615#false} is VALID [2018-11-23 11:52:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:52,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:52,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:52,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:55,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:52:55,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:55,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:56,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {7614#true} call ULTIMATE.init(); {7614#true} is VALID [2018-11-23 11:52:56,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {7614#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7614#true} is VALID [2018-11-23 11:52:56,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {7614#true} assume true; {7614#true} is VALID [2018-11-23 11:52:56,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7614#true} {7614#true} #77#return; {7614#true} is VALID [2018-11-23 11:52:56,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {7614#true} call #t~ret10 := main(); {7614#true} is VALID [2018-11-23 11:52:56,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {7614#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7614#true} is VALID [2018-11-23 11:52:56,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7614#true} is VALID [2018-11-23 11:52:56,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {7614#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7614#true} is VALID [2018-11-23 11:52:56,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {7614#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7737#(< main_~a~0 100000)} is VALID [2018-11-23 11:52:56,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {7737#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7741#(<= main_~a~0 100000)} is VALID [2018-11-23 11:52:56,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {7741#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {7614#true} is VALID [2018-11-23 11:52:56,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {7614#true} havoc ~i~0;~i~0 := 0; {7748#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:56,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {7748#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7748#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:56,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {7748#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7755#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:56,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {7755#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7755#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:56,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {7755#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7762#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {7762#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7762#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {7762#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7769#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {7769#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7769#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {7769#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7776#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {7776#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7776#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {7776#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7783#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {7783#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7783#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {7783#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7790#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {7790#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7790#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {7790#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7797#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {7797#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7797#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {7797#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7804#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {7804#(<= main_~i~0 8)} assume !(~i~0 < 100000); {7615#false} is VALID [2018-11-23 11:52:56,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {7615#false} ~i~0 := 0; {7615#false} is VALID [2018-11-23 11:52:56,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,421 INFO L273 TraceCheckUtils]: 65: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,421 INFO L273 TraceCheckUtils]: 66: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {7615#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 71: Hoare triple {7615#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {7615#false} assume !(~i~0 < 100000); {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {7615#false} havoc ~x~0;~x~0 := 0; {7615#false} is VALID [2018-11-23 11:52:56,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {7615#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {7615#false} is VALID [2018-11-23 11:52:56,423 INFO L256 TraceCheckUtils]: 75: Hoare triple {7615#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {7615#false} is VALID [2018-11-23 11:52:56,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {7615#false} ~cond := #in~cond; {7615#false} is VALID [2018-11-23 11:52:56,423 INFO L273 TraceCheckUtils]: 77: Hoare triple {7615#false} assume 0 == ~cond; {7615#false} is VALID [2018-11-23 11:52:56,423 INFO L273 TraceCheckUtils]: 78: Hoare triple {7615#false} assume !false; {7615#false} is VALID [2018-11-23 11:52:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 29 proven. 64 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 11:52:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-23 11:52:56,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-11-23 11:52:56,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:56,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:52:56,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:56,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:52:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:52:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:56,534 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 29 states. [2018-11-23 11:52:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:58,352 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-11-23 11:52:58,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:52:58,353 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-11-23 11:52:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 120 transitions. [2018-11-23 11:52:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 120 transitions. [2018-11-23 11:52:58,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 120 transitions. [2018-11-23 11:52:58,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:58,532 INFO L225 Difference]: With dead ends: 141 [2018-11-23 11:52:58,532 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 11:52:58,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:52:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 11:52:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-23 11:52:58,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:58,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-23 11:52:58,587 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-23 11:52:58,587 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-23 11:52:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:58,589 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-23 11:52:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-11-23 11:52:58,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:58,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:58,590 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-23 11:52:58,590 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-23 11:52:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:58,592 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-23 11:52:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-11-23 11:52:58,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:58,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:58,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:58,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 11:52:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-23 11:52:58,595 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 79 [2018-11-23 11:52:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:58,595 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-23 11:52:58,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:52:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 11:52:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:52:58,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:58,597 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:58,597 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1907999244, now seen corresponding path program 16 times [2018-11-23 11:52:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:58,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:59,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2018-11-23 11:52:59,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {8429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8429#true} is VALID [2018-11-23 11:52:59,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2018-11-23 11:52:59,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #77#return; {8429#true} is VALID [2018-11-23 11:52:59,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret10 := main(); {8429#true} is VALID [2018-11-23 11:52:59,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {8429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8431#(= main_~a~0 0)} is VALID [2018-11-23 11:52:59,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {8431#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8431#(= main_~a~0 0)} is VALID [2018-11-23 11:52:59,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {8431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8432#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:59,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {8432#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8432#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:59,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {8432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8433#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:59,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {8433#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8433#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:59,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {8433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8434#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:59,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {8434#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8434#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:59,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {8434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8435#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:59,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {8435#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8435#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:59,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {8435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8436#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:59,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {8436#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8436#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:59,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {8436#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8437#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:59,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {8437#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8437#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:59,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {8437#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8438#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:59,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {8438#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8438#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:59,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {8438#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8439#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:59,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {8439#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8439#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:59,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {8439#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8440#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:59,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {8440#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8440#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:59,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {8440#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8441#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:59,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {8441#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8441#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:59,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {8441#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8442#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:59,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {8442#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8442#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:59,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {8442#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8443#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:59,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {8443#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8443#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:59,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {8443#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8444#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:59,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {8444#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8444#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:59,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {8444#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8445#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:59,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {8445#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8445#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:59,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {8445#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8446#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:59,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {8446#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8446#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:59,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {8446#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8447#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:59,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {8447#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8447#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:59,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {8447#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8448#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:59,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {8448#(<= main_~a~0 17)} assume !(~a~0 < 100000); {8430#false} is VALID [2018-11-23 11:52:59,808 INFO L273 TraceCheckUtils]: 41: Hoare triple {8430#false} havoc ~i~0;~i~0 := 0; {8430#false} is VALID [2018-11-23 11:52:59,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,808 INFO L273 TraceCheckUtils]: 43: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,809 INFO L273 TraceCheckUtils]: 46: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,809 INFO L273 TraceCheckUtils]: 48: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,809 INFO L273 TraceCheckUtils]: 49: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 54: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 55: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 57: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,810 INFO L273 TraceCheckUtils]: 58: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 59: Hoare triple {8430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 60: Hoare triple {8430#false} assume !(~i~0 < 100000); {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 61: Hoare triple {8430#false} ~i~0 := 0; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 62: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 65: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 66: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,811 INFO L273 TraceCheckUtils]: 67: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 68: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 69: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 72: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 73: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,812 INFO L273 TraceCheckUtils]: 74: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 75: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 76: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 77: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 78: Hoare triple {8430#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 79: Hoare triple {8430#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8430#false} is VALID [2018-11-23 11:52:59,813 INFO L273 TraceCheckUtils]: 80: Hoare triple {8430#false} assume !(~i~0 < 100000); {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L273 TraceCheckUtils]: 81: Hoare triple {8430#false} havoc ~x~0;~x~0 := 0; {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L273 TraceCheckUtils]: 82: Hoare triple {8430#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L256 TraceCheckUtils]: 83: Hoare triple {8430#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L273 TraceCheckUtils]: 84: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L273 TraceCheckUtils]: 85: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2018-11-23 11:52:59,814 INFO L273 TraceCheckUtils]: 86: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2018-11-23 11:52:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 11:52:59,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:59,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:59,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:59,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:59,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:59,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:00,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {8429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #77#return; {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret10 := main(); {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {8429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8429#true} is VALID [2018-11-23 11:53:00,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 29: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {8429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {8429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8429#true} is VALID [2018-11-23 11:53:00,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {8429#true} assume !(~a~0 < 100000); {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {8429#true} havoc ~i~0;~i~0 := 0; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 47: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 52: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 54: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 57: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,267 INFO L273 TraceCheckUtils]: 58: Hoare triple {8429#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8429#true} is VALID [2018-11-23 11:53:00,268 INFO L273 TraceCheckUtils]: 59: Hoare triple {8429#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8429#true} is VALID [2018-11-23 11:53:00,268 INFO L273 TraceCheckUtils]: 60: Hoare triple {8429#true} assume !(~i~0 < 100000); {8429#true} is VALID [2018-11-23 11:53:00,268 INFO L273 TraceCheckUtils]: 61: Hoare triple {8429#true} ~i~0 := 0; {8635#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:00,269 INFO L273 TraceCheckUtils]: 62: Hoare triple {8635#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8635#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:00,269 INFO L273 TraceCheckUtils]: 63: Hoare triple {8635#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8642#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,269 INFO L273 TraceCheckUtils]: 64: Hoare triple {8642#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8642#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,270 INFO L273 TraceCheckUtils]: 65: Hoare triple {8642#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8649#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,270 INFO L273 TraceCheckUtils]: 66: Hoare triple {8649#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8649#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,271 INFO L273 TraceCheckUtils]: 67: Hoare triple {8649#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8656#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,271 INFO L273 TraceCheckUtils]: 68: Hoare triple {8656#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8656#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,272 INFO L273 TraceCheckUtils]: 69: Hoare triple {8656#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8663#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,272 INFO L273 TraceCheckUtils]: 70: Hoare triple {8663#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8663#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,273 INFO L273 TraceCheckUtils]: 71: Hoare triple {8663#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8670#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,274 INFO L273 TraceCheckUtils]: 72: Hoare triple {8670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8670#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,274 INFO L273 TraceCheckUtils]: 73: Hoare triple {8670#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8677#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,275 INFO L273 TraceCheckUtils]: 74: Hoare triple {8677#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8677#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,276 INFO L273 TraceCheckUtils]: 75: Hoare triple {8677#(<= main_~i~0 6)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8684#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,276 INFO L273 TraceCheckUtils]: 76: Hoare triple {8684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8684#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,277 INFO L273 TraceCheckUtils]: 77: Hoare triple {8684#(<= main_~i~0 7)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8691#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,278 INFO L273 TraceCheckUtils]: 78: Hoare triple {8691#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8691#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,278 INFO L273 TraceCheckUtils]: 79: Hoare triple {8691#(<= main_~i~0 8)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8698#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,279 INFO L273 TraceCheckUtils]: 80: Hoare triple {8698#(<= main_~i~0 9)} assume !(~i~0 < 100000); {8430#false} is VALID [2018-11-23 11:53:00,279 INFO L273 TraceCheckUtils]: 81: Hoare triple {8430#false} havoc ~x~0;~x~0 := 0; {8430#false} is VALID [2018-11-23 11:53:00,279 INFO L273 TraceCheckUtils]: 82: Hoare triple {8430#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {8430#false} is VALID [2018-11-23 11:53:00,280 INFO L256 TraceCheckUtils]: 83: Hoare triple {8430#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {8430#false} is VALID [2018-11-23 11:53:00,280 INFO L273 TraceCheckUtils]: 84: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2018-11-23 11:53:00,280 INFO L273 TraceCheckUtils]: 85: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2018-11-23 11:53:00,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2018-11-23 11:53:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-11-23 11:53:00,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:00,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2018-11-23 11:53:00,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-11-23 11:53:00,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:00,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:53:00,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:00,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:53:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:53:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:53:00,392 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 30 states. [2018-11-23 11:53:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,018 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 11:53:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:53:01,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-11-23 11:53:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:53:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 126 transitions. [2018-11-23 11:53:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:53:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 126 transitions. [2018-11-23 11:53:01,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 126 transitions. [2018-11-23 11:53:01,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:01,677 INFO L225 Difference]: With dead ends: 152 [2018-11-23 11:53:01,678 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:53:01,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:53:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:53:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-23 11:53:01,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:01,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 98 states. [2018-11-23 11:53:01,745 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 98 states. [2018-11-23 11:53:01,745 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 98 states. [2018-11-23 11:53:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,749 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-23 11:53:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-23 11:53:01,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:01,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:01,749 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 101 states. [2018-11-23 11:53:01,749 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 101 states. [2018-11-23 11:53:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:01,752 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-23 11:53:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-23 11:53:01,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:01,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:01,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:01,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:53:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-23 11:53:01,755 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 87 [2018-11-23 11:53:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:01,755 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-23 11:53:01,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:53:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-23 11:53:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:53:01,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:01,756 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:01,757 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:01,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash 501658766, now seen corresponding path program 17 times [2018-11-23 11:53:01,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:01,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:01,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:02,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {9290#true} call ULTIMATE.init(); {9290#true} is VALID [2018-11-23 11:53:02,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {9290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9290#true} is VALID [2018-11-23 11:53:02,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {9290#true} assume true; {9290#true} is VALID [2018-11-23 11:53:02,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9290#true} {9290#true} #77#return; {9290#true} is VALID [2018-11-23 11:53:02,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {9290#true} call #t~ret10 := main(); {9290#true} is VALID [2018-11-23 11:53:02,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {9290#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9292#(= main_~a~0 0)} is VALID [2018-11-23 11:53:02,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {9292#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9292#(= main_~a~0 0)} is VALID [2018-11-23 11:53:02,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {9292#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9293#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:02,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {9293#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9293#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:02,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {9293#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9294#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:02,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {9294#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9294#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:02,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {9294#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9295#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:02,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {9295#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9295#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:02,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {9295#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9296#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:02,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {9296#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9296#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:02,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {9296#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9297#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:02,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {9297#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9297#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:02,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {9297#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9298#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:02,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {9298#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9298#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {9298#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9299#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:02,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {9299#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9299#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:02,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {9299#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9300#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:02,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {9300#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9300#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:02,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {9300#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9301#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:02,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {9301#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9301#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:02,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {9301#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9302#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:02,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {9302#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9302#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:02,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {9302#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9303#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:02,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {9303#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9303#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:02,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {9303#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9304#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:02,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {9304#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9304#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:02,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {9304#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9305#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:02,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {9305#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9305#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:02,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {9305#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9306#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:02,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {9306#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9306#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:02,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {9306#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9307#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:02,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {9307#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9307#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:02,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {9307#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9308#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:02,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {9308#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9308#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:02,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {9308#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9309#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:02,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {9309#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9309#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:02,781 INFO L273 TraceCheckUtils]: 41: Hoare triple {9309#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9310#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:02,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {9310#(<= main_~a~0 18)} assume !(~a~0 < 100000); {9291#false} is VALID [2018-11-23 11:53:02,782 INFO L273 TraceCheckUtils]: 43: Hoare triple {9291#false} havoc ~i~0;~i~0 := 0; {9291#false} is VALID [2018-11-23 11:53:02,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,783 INFO L273 TraceCheckUtils]: 51: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,784 INFO L273 TraceCheckUtils]: 53: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,784 INFO L273 TraceCheckUtils]: 54: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,785 INFO L273 TraceCheckUtils]: 56: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,785 INFO L273 TraceCheckUtils]: 59: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,786 INFO L273 TraceCheckUtils]: 60: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,786 INFO L273 TraceCheckUtils]: 61: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,786 INFO L273 TraceCheckUtils]: 62: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9291#false} is VALID [2018-11-23 11:53:02,786 INFO L273 TraceCheckUtils]: 63: Hoare triple {9291#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9291#false} is VALID [2018-11-23 11:53:02,786 INFO L273 TraceCheckUtils]: 64: Hoare triple {9291#false} assume !(~i~0 < 100000); {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 65: Hoare triple {9291#false} ~i~0 := 0; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 66: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 67: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 68: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 69: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 73: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 74: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 75: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 81: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 83: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 84: Hoare triple {9291#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 85: Hoare triple {9291#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 86: Hoare triple {9291#false} assume !(~i~0 < 100000); {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {9291#false} havoc ~x~0;~x~0 := 0; {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {9291#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9291#false} is VALID [2018-11-23 11:53:02,789 INFO L256 TraceCheckUtils]: 89: Hoare triple {9291#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {9291#false} is VALID [2018-11-23 11:53:02,790 INFO L273 TraceCheckUtils]: 90: Hoare triple {9291#false} ~cond := #in~cond; {9291#false} is VALID [2018-11-23 11:53:02,790 INFO L273 TraceCheckUtils]: 91: Hoare triple {9291#false} assume 0 == ~cond; {9291#false} is VALID [2018-11-23 11:53:02,790 INFO L273 TraceCheckUtils]: 92: Hoare triple {9291#false} assume !false; {9291#false} is VALID [2018-11-23 11:53:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 11:53:02,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:02,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:02,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:30,415 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 11:54:30,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:30,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:30,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {9290#true} call ULTIMATE.init(); {9290#true} is VALID [2018-11-23 11:54:30,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {9290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9290#true} is VALID [2018-11-23 11:54:30,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {9290#true} assume true; {9290#true} is VALID [2018-11-23 11:54:30,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9290#true} {9290#true} #77#return; {9290#true} is VALID [2018-11-23 11:54:30,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {9290#true} call #t~ret10 := main(); {9290#true} is VALID [2018-11-23 11:54:30,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {9290#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9290#true} is VALID [2018-11-23 11:54:30,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 30: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 31: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 32: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 40: Hoare triple {9290#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {9290#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {9290#true} assume !(~a~0 < 100000); {9290#true} is VALID [2018-11-23 11:54:30,832 INFO L273 TraceCheckUtils]: 43: Hoare triple {9290#true} havoc ~i~0;~i~0 := 0; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 44: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 54: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 55: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 56: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 57: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 59: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,834 INFO L273 TraceCheckUtils]: 61: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {9290#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9290#true} is VALID [2018-11-23 11:54:30,835 INFO L273 TraceCheckUtils]: 63: Hoare triple {9290#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9290#true} is VALID [2018-11-23 11:54:30,835 INFO L273 TraceCheckUtils]: 64: Hoare triple {9290#true} assume !(~i~0 < 100000); {9290#true} is VALID [2018-11-23 11:54:30,835 INFO L273 TraceCheckUtils]: 65: Hoare triple {9290#true} ~i~0 := 0; {9509#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:30,836 INFO L273 TraceCheckUtils]: 66: Hoare triple {9509#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9509#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:30,836 INFO L273 TraceCheckUtils]: 67: Hoare triple {9509#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9516#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,837 INFO L273 TraceCheckUtils]: 68: Hoare triple {9516#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9516#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {9516#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9523#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {9523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9523#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,838 INFO L273 TraceCheckUtils]: 71: Hoare triple {9523#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9530#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {9530#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9530#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,838 INFO L273 TraceCheckUtils]: 73: Hoare triple {9530#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9537#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,839 INFO L273 TraceCheckUtils]: 74: Hoare triple {9537#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9537#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,839 INFO L273 TraceCheckUtils]: 75: Hoare triple {9537#(<= main_~i~0 4)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9544#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {9544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9544#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {9544#(<= main_~i~0 5)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9551#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,841 INFO L273 TraceCheckUtils]: 78: Hoare triple {9551#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9551#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {9551#(<= main_~i~0 6)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9558#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,842 INFO L273 TraceCheckUtils]: 80: Hoare triple {9558#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9558#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,843 INFO L273 TraceCheckUtils]: 81: Hoare triple {9558#(<= main_~i~0 7)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9565#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,843 INFO L273 TraceCheckUtils]: 82: Hoare triple {9565#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9565#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {9565#(<= main_~i~0 8)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9572#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {9572#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9572#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,845 INFO L273 TraceCheckUtils]: 85: Hoare triple {9572#(<= main_~i~0 9)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9579#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,846 INFO L273 TraceCheckUtils]: 86: Hoare triple {9579#(<= main_~i~0 10)} assume !(~i~0 < 100000); {9291#false} is VALID [2018-11-23 11:54:30,846 INFO L273 TraceCheckUtils]: 87: Hoare triple {9291#false} havoc ~x~0;~x~0 := 0; {9291#false} is VALID [2018-11-23 11:54:30,846 INFO L273 TraceCheckUtils]: 88: Hoare triple {9291#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {9291#false} is VALID [2018-11-23 11:54:30,846 INFO L256 TraceCheckUtils]: 89: Hoare triple {9291#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {9291#false} is VALID [2018-11-23 11:54:30,846 INFO L273 TraceCheckUtils]: 90: Hoare triple {9291#false} ~cond := #in~cond; {9291#false} is VALID [2018-11-23 11:54:30,847 INFO L273 TraceCheckUtils]: 91: Hoare triple {9291#false} assume 0 == ~cond; {9291#false} is VALID [2018-11-23 11:54:30,847 INFO L273 TraceCheckUtils]: 92: Hoare triple {9291#false} assume !false; {9291#false} is VALID [2018-11-23 11:54:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-11-23 11:54:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2018-11-23 11:54:30,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2018-11-23 11:54:30,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:30,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:54:30,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:30,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:54:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:54:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:54:30,971 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 32 states. [2018-11-23 11:54:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,268 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2018-11-23 11:54:32,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:54:32,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2018-11-23 11:54:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 132 transitions. [2018-11-23 11:54:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 132 transitions. [2018-11-23 11:54:32,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 132 transitions. [2018-11-23 11:54:32,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:32,846 INFO L225 Difference]: With dead ends: 162 [2018-11-23 11:54:32,846 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:54:32,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:54:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:54:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-23 11:54:32,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:32,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 104 states. [2018-11-23 11:54:32,905 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 104 states. [2018-11-23 11:54:32,905 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 104 states. [2018-11-23 11:54:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,908 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-11-23 11:54:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 11:54:32,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,909 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 107 states. [2018-11-23 11:54:32,909 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 107 states. [2018-11-23 11:54:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,911 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-11-23 11:54:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 11:54:32,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:32,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:54:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-23 11:54:32,915 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 93 [2018-11-23 11:54:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-23 11:54:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:54:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 11:54:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:54:32,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:32,916 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:32,916 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:32,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -647360600, now seen corresponding path program 18 times [2018-11-23 11:54:32,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {10207#true} call ULTIMATE.init(); {10207#true} is VALID [2018-11-23 11:54:34,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {10207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10207#true} is VALID [2018-11-23 11:54:34,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {10207#true} assume true; {10207#true} is VALID [2018-11-23 11:54:34,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10207#true} {10207#true} #77#return; {10207#true} is VALID [2018-11-23 11:54:34,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {10207#true} call #t~ret10 := main(); {10207#true} is VALID [2018-11-23 11:54:34,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {10207#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10209#(= main_~a~0 0)} is VALID [2018-11-23 11:54:34,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {10209#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10209#(= main_~a~0 0)} is VALID [2018-11-23 11:54:34,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {10209#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10210#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {10210#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10210#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {10210#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10211#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {10211#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10211#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {10211#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10212#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {10212#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10212#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {10212#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10213#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {10213#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10213#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {10213#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10214#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {10214#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10214#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {10214#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10215#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {10215#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10215#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {10215#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10216#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {10216#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10216#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {10216#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10217#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {10217#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10217#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {10217#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10218#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {10218#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10218#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {10218#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10219#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {10219#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10219#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {10219#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10220#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {10220#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10220#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {10220#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10221#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {10221#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10221#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {10221#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10222#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,092 INFO L273 TraceCheckUtils]: 32: Hoare triple {10222#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10222#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {10222#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10223#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {10223#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10223#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {10223#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10224#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {10224#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10224#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {10224#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10225#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {10225#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10225#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {10225#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10226#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {10226#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10226#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {10226#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10227#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {10227#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10227#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {10227#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10228#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:34,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {10228#(<= main_~a~0 19)} assume !(~a~0 < 100000); {10208#false} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {10208#false} havoc ~i~0;~i~0 := 0; {10208#false} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 53: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,101 INFO L273 TraceCheckUtils]: 54: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 55: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 56: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 57: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 60: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,102 INFO L273 TraceCheckUtils]: 61: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 64: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 65: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 66: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 67: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 68: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 69: Hoare triple {10208#false} ~i~0 := 0; {10208#false} is VALID [2018-11-23 11:54:34,103 INFO L273 TraceCheckUtils]: 70: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 71: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 72: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 73: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 74: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 75: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 76: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 77: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 78: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,104 INFO L273 TraceCheckUtils]: 79: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 81: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 82: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 83: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 84: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 85: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 86: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,105 INFO L273 TraceCheckUtils]: 87: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 88: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 89: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 90: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 91: Hoare triple {10208#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 92: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {10208#false} havoc ~x~0;~x~0 := 0; {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 94: Hoare triple {10208#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~x~0, 4); {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L256 TraceCheckUtils]: 95: Hoare triple {10208#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1 else 0)); {10208#false} is VALID [2018-11-23 11:54:34,106 INFO L273 TraceCheckUtils]: 96: Hoare triple {10208#false} ~cond := #in~cond; {10208#false} is VALID [2018-11-23 11:54:34,107 INFO L273 TraceCheckUtils]: 97: Hoare triple {10208#false} assume 0 == ~cond; {10208#false} is VALID [2018-11-23 11:54:34,107 INFO L273 TraceCheckUtils]: 98: Hoare triple {10208#false} assume !false; {10208#false} is VALID [2018-11-23 11:54:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 11:54:34,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:34,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:34,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE