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_seq_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:06:14,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:06:14,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:06:14,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:06:14,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:06:14,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:06:14,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:06:14,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:06:14,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:06:14,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:06:14,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:06:14,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:06:14,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:06:14,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:06:14,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:06:14,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:06:14,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:06:14,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:06:14,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:06:14,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:06:14,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:06:14,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:06:14,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:06:14,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:06:14,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:06:14,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:06:14,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:06:14,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:06:14,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:06:14,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:06:14,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:06:14,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:06:14,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:06:14,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:06:14,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:06:14,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:06:14,290 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:06:14,319 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:06:14,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:06:14,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:06:14,324 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:06:14,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:06:14,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:06:14,325 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:06:14,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:06:14,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:06:14,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:06:14,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:06:14,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:06:14,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:06:14,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:06:14,328 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:06:14,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:06:14,328 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:06:14,329 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:06:14,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:06:14,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:06:14,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:06:14,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:06:14,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:06:14,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:14,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:06:14,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:06:14,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:06:14,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:06:14,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:06:14,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:06:14,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:06:14,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:06:14,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:06:14,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:06:14,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:06:14,404 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:06:14,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_seq_init_true-unreach-call_ground.i [2018-11-23 12:06:14,473 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb949beb/60e5b4e3075f4e6d9b9c670abd6db49f/FLAG973bc5958 [2018-11-23 12:06:14,928 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:06:14,929 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_seq_init_true-unreach-call_ground.i [2018-11-23 12:06:14,935 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb949beb/60e5b4e3075f4e6d9b9c670abd6db49f/FLAG973bc5958 [2018-11-23 12:06:15,288 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb949beb/60e5b4e3075f4e6d9b9c670abd6db49f [2018-11-23 12:06:15,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:06:15,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:06:15,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:15,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:06:15,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:06:15,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c31d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15, skipping insertion in model container [2018-11-23 12:06:15,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:06:15,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:06:15,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:15,557 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:06:15,580 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:15,605 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:06:15,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15 WrapperNode [2018-11-23 12:06:15,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:15,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:15,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:06:15,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:06:15,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:15,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:06:15,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:06:15,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:06:15,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... [2018-11-23 12:06:15,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:06:15,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:06:15,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:06:15,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:06:15,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:06:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:06:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:06:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:06:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:06:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:06:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:06:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:06:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:06:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:06:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:06:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:06:16,334 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:06:16,335 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:06:16,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:16 BoogieIcfgContainer [2018-11-23 12:06:16,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:06:16,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:06:16,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:06:16,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:06:16,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:06:15" (1/3) ... [2018-11-23 12:06:16,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f1f705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:16, skipping insertion in model container [2018-11-23 12:06:16,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:15" (2/3) ... [2018-11-23 12:06:16,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f1f705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:16, skipping insertion in model container [2018-11-23 12:06:16,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:16" (3/3) ... [2018-11-23 12:06:16,342 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_seq_init_true-unreach-call_ground.i [2018-11-23 12:06:16,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:06:16,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:06:16,377 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:06:16,409 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:06:16,410 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:06:16,410 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:06:16,410 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:06:16,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:06:16,411 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:06:16,411 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:06:16,411 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:06:16,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:06:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 12:06:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:06:16,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:16,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:16,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:16,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 12:06:16,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:16,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 12:06:16,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-23 12:06:16,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 12:06:16,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 12:06:16,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2018-11-23 12:06:16,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {26#true} is VALID [2018-11-23 12:06:16,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 12:06:16,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 1; {27#false} is VALID [2018-11-23 12:06:16,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {27#false} is VALID [2018-11-23 12:06:16,591 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {27#false} is VALID [2018-11-23 12:06:16,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 12:06:16,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-23 12:06:16,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 12:06:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:16,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:06:16,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:06:16,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:16,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:06:16,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:16,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:06:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:06:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:16,710 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 12:06:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,897 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 12:06:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:06:16,897 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:06:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:06:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:06:16,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 12:06:17,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,239 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:06:17,239 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:06:17,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:06:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:06:17,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:17,383 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:17,383 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,387 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:06:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:06:17,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,388 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:17,388 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,392 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:06:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:06:17,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:06:17,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:06:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:17,399 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:06:17,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:06:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:06:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:06:17,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:17,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:17,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:17,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 12:06:17,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:17,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-23 12:06:17,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {142#true} is VALID [2018-11-23 12:06:17,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-23 12:06:17,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #48#return; {142#true} is VALID [2018-11-23 12:06:17,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret4 := main(); {142#true} is VALID [2018-11-23 12:06:17,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {144#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:17,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {144#(<= main_~i~0 1)} assume !(~i~0 < 100000); {143#false} is VALID [2018-11-23 12:06:17,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#false} havoc ~x~0;~x~0 := 1; {143#false} is VALID [2018-11-23 12:06:17,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {143#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {143#false} is VALID [2018-11-23 12:06:17,554 INFO L256 TraceCheckUtils]: 9: Hoare triple {143#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {143#false} is VALID [2018-11-23 12:06:17,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2018-11-23 12:06:17,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2018-11-23 12:06:17,555 INFO L273 TraceCheckUtils]: 12: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-23 12:06:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:17,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:06:17,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:06:17,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:17,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:06:17,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:06:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:06:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:17,601 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 12:06:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,811 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:06:17,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:06:17,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:06:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 12:06:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:06:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 12:06:17,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 12:06:17,920 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 12:06:17,922 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:06:17,922 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:06:17,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:06:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:06:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:06:17,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:17,943 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:17,943 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,946 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:06:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:06:17,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,948 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:17,948 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:06:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,950 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:06:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:06:17,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 12:06:17,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 12:06:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:17,954 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 12:06:17,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:06:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:06:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:06:17,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:17,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:17,957 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:17,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 12:06:17,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 12:06:18,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 12:06:18,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 12:06:18,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 12:06:18,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret4 := main(); {255#true} is VALID [2018-11-23 12:06:18,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {257#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {258#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 2)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 12:06:18,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 1; {256#false} is VALID [2018-11-23 12:06:18,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {256#false} is VALID [2018-11-23 12:06:18,073 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {256#false} is VALID [2018-11-23 12:06:18,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 12:06:18,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 12:06:18,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 12:06:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:18,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:18,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:18,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 12:06:18,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 12:06:18,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 12:06:18,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 12:06:18,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret4 := main(); {255#true} is VALID [2018-11-23 12:06:18,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {257#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {258#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 2)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 12:06:18,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 1; {256#false} is VALID [2018-11-23 12:06:18,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {256#false} is VALID [2018-11-23 12:06:18,568 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {256#false} is VALID [2018-11-23 12:06:18,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 12:06:18,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 12:06:18,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 12:06:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:18,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 12:06:18,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:06:18,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:18,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:06:18,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:18,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:06:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:06:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:06:18,624 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-23 12:06:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,878 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:06:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:06:18,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:06:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:06:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 12:06:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:06:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 12:06:18,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-23 12:06:18,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:18,959 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:06:18,960 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:06:18,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:06:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:06:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:06:18,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:18,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:06:18,975 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:06:18,976 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:06:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,978 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:06:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:06:18,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,979 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:06:18,979 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:06:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,982 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:06:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:06:18,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:18,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:06:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:06:18,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 12:06:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:18,985 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:06:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:06:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:06:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:06:18,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:18,986 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:18,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:18,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1794669362, now seen corresponding path program 2 times [2018-11-23 12:06:18,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:18,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2018-11-23 12:06:19,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {414#true} is VALID [2018-11-23 12:06:19,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 12:06:19,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #48#return; {414#true} is VALID [2018-11-23 12:06:19,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2018-11-23 12:06:19,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {414#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {416#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {417#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {418#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(<= main_~i~0 3)} assume !(~i~0 < 100000); {415#false} is VALID [2018-11-23 12:06:19,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {415#false} havoc ~x~0;~x~0 := 1; {415#false} is VALID [2018-11-23 12:06:19,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {415#false} is VALID [2018-11-23 12:06:19,154 INFO L256 TraceCheckUtils]: 11: Hoare triple {415#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {415#false} is VALID [2018-11-23 12:06:19,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2018-11-23 12:06:19,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2018-11-23 12:06:19,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {415#false} assume !false; {415#false} is VALID [2018-11-23 12:06:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:19,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:19,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:19,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:19,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:19,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2018-11-23 12:06:19,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {414#true} is VALID [2018-11-23 12:06:19,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 12:06:19,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #48#return; {414#true} is VALID [2018-11-23 12:06:19,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2018-11-23 12:06:19,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {414#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {416#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {417#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {418#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(<= main_~i~0 3)} assume !(~i~0 < 100000); {415#false} is VALID [2018-11-23 12:06:19,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {415#false} havoc ~x~0;~x~0 := 1; {415#false} is VALID [2018-11-23 12:06:19,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {415#false} is VALID [2018-11-23 12:06:19,321 INFO L256 TraceCheckUtils]: 11: Hoare triple {415#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {415#false} is VALID [2018-11-23 12:06:19,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2018-11-23 12:06:19,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2018-11-23 12:06:19,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {415#false} assume !false; {415#false} is VALID [2018-11-23 12:06:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 12:06:19,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:06:19,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:19,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:19,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:19,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:19,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:19,383 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-23 12:06:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,546 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 12:06:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:06:19,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:06:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:06:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:06:19,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 12:06:19,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:19,657 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:06:19,657 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:06:19,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 12:06:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:06:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:06:19,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:19,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:19,673 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:19,673 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,675 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:06:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:06:19,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,676 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:19,676 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:06:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:19,678 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:06:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:06:19,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:19,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:19,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:19,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:06:19,680 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-23 12:06:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:19,681 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:06:19,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:06:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:06:19,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:19,682 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:19,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:19,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2004063982, now seen corresponding path program 3 times [2018-11-23 12:06:19,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 12:06:19,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {583#true} is VALID [2018-11-23 12:06:19,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:06:19,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #48#return; {583#true} is VALID [2018-11-23 12:06:19,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2018-11-23 12:06:19,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {585#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {586#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {587#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {587#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {588#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {588#(<= main_~i~0 4)} assume !(~i~0 < 100000); {584#false} is VALID [2018-11-23 12:06:19,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {584#false} havoc ~x~0;~x~0 := 1; {584#false} is VALID [2018-11-23 12:06:19,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {584#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {584#false} is VALID [2018-11-23 12:06:19,853 INFO L256 TraceCheckUtils]: 12: Hoare triple {584#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {584#false} is VALID [2018-11-23 12:06:19,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#false} ~cond := #in~cond; {584#false} is VALID [2018-11-23 12:06:19,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {584#false} assume 0 == ~cond; {584#false} is VALID [2018-11-23 12:06:19,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 12:06:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:19,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:19,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:19,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:06:19,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:19,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 12:06:19,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {583#true} is VALID [2018-11-23 12:06:19,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:06:19,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #48#return; {583#true} is VALID [2018-11-23 12:06:19,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2018-11-23 12:06:19,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {585#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:19,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {586#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:19,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {587#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:19,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {587#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {588#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:19,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {588#(<= main_~i~0 4)} assume !(~i~0 < 100000); {584#false} is VALID [2018-11-23 12:06:19,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {584#false} havoc ~x~0;~x~0 := 1; {584#false} is VALID [2018-11-23 12:06:19,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {584#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {584#false} is VALID [2018-11-23 12:06:19,980 INFO L256 TraceCheckUtils]: 12: Hoare triple {584#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {584#false} is VALID [2018-11-23 12:06:19,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#false} ~cond := #in~cond; {584#false} is VALID [2018-11-23 12:06:19,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {584#false} assume 0 == ~cond; {584#false} is VALID [2018-11-23 12:06:19,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 12:06:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:20,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:20,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:06:20,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 12:06:20,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:20,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:06:20,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:06:20,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:06:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:20,062 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-23 12:06:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,243 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:06:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:06:20,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 12:06:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:06:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:06:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:06:20,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-23 12:06:20,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,306 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:06:20,306 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:06:20,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:06:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:06:20,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:20,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:20,328 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:20,328 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,330 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:06:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:06:20,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,331 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:20,331 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,333 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:06:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:06:20,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:20,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 12:06:20,336 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2018-11-23 12:06:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:20,336 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 12:06:20,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:06:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:06:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:06:20,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:20,338 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:20,338 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:20,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 4 times [2018-11-23 12:06:20,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 12:06:20,473 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 12:06:20,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 12:06:20,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #48#return; {762#true} is VALID [2018-11-23 12:06:20,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-23 12:06:20,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {764#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:20,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {765#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:20,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {765#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {766#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:20,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {767#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:20,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {767#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {768#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:20,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {768#(<= main_~i~0 5)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 12:06:20,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#false} havoc ~x~0;~x~0 := 1; {763#false} is VALID [2018-11-23 12:06:20,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {763#false} is VALID [2018-11-23 12:06:20,512 INFO L256 TraceCheckUtils]: 13: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {763#false} is VALID [2018-11-23 12:06:20,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 12:06:20,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 12:06:20,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 12:06:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:20,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:20,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:20,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:20,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:20,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:20,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-23 12:06:20,723 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 12:06:20,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-23 12:06:20,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #48#return; {762#true} is VALID [2018-11-23 12:06:20,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-23 12:06:20,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {764#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:20,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {765#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:20,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {765#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {766#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:20,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {767#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:20,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {767#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {768#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:20,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {768#(<= main_~i~0 5)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-23 12:06:20,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#false} havoc ~x~0;~x~0 := 1; {763#false} is VALID [2018-11-23 12:06:20,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {763#false} is VALID [2018-11-23 12:06:20,731 INFO L256 TraceCheckUtils]: 13: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {763#false} is VALID [2018-11-23 12:06:20,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-23 12:06:20,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2018-11-23 12:06:20,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-23 12:06:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:20,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:20,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 12:06:20,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 12:06:20,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:20,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:06:20,773 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 12:06:20,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:06:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:06:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:20,774 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-11-23 12:06:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,847 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:06:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:06:20,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 12:06:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 12:06:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:06:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 12:06:20,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2018-11-23 12:06:20,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:20,907 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:06:20,907 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:06:20,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:06:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:06:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 12:06:20,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:20,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:20,924 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:20,924 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,926 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:06:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:06:20,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:20,927 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:06:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:20,928 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:06:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:06:20,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:20,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:20,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:20,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:06:20,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2018-11-23 12:06:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:20,931 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:06:20,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:06:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:06:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:06:20,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:20,933 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:20,933 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:20,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -729870482, now seen corresponding path program 5 times [2018-11-23 12:06:20,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2018-11-23 12:06:21,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {951#true} is VALID [2018-11-23 12:06:21,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2018-11-23 12:06:21,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #48#return; {951#true} is VALID [2018-11-23 12:06:21,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret4 := main(); {951#true} is VALID [2018-11-23 12:06:21,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {951#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {953#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {954#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {955#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {956#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {957#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {958#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {958#(<= main_~i~0 6)} assume !(~i~0 < 100000); {952#false} is VALID [2018-11-23 12:06:21,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {952#false} havoc ~x~0;~x~0 := 1; {952#false} is VALID [2018-11-23 12:06:21,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {952#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {952#false} is VALID [2018-11-23 12:06:21,101 INFO L256 TraceCheckUtils]: 14: Hoare triple {952#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {952#false} is VALID [2018-11-23 12:06:21,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {952#false} ~cond := #in~cond; {952#false} is VALID [2018-11-23 12:06:21,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#false} assume 0 == ~cond; {952#false} is VALID [2018-11-23 12:06:21,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#false} assume !false; {952#false} is VALID [2018-11-23 12:06:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:21,112 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:21,131 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:06:21,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:21,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2018-11-23 12:06:21,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {951#true} is VALID [2018-11-23 12:06:21,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2018-11-23 12:06:21,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #48#return; {951#true} is VALID [2018-11-23 12:06:21,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret4 := main(); {951#true} is VALID [2018-11-23 12:06:21,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {951#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {953#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {954#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {955#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {956#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {957#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {958#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {958#(<= main_~i~0 6)} assume !(~i~0 < 100000); {952#false} is VALID [2018-11-23 12:06:21,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {952#false} havoc ~x~0;~x~0 := 1; {952#false} is VALID [2018-11-23 12:06:21,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {952#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {952#false} is VALID [2018-11-23 12:06:21,310 INFO L256 TraceCheckUtils]: 14: Hoare triple {952#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {952#false} is VALID [2018-11-23 12:06:21,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {952#false} ~cond := #in~cond; {952#false} is VALID [2018-11-23 12:06:21,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#false} assume 0 == ~cond; {952#false} is VALID [2018-11-23 12:06:21,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#false} assume !false; {952#false} is VALID [2018-11-23 12:06:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:21,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 12:06:21,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 12:06:21,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:21,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:06:21,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:21,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:06:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:06:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:21,356 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-23 12:06:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,535 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:06:21,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:06:21,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 12:06:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 12:06:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:06:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 12:06:21,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 12:06:21,672 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 12:06:21,673 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:06:21,673 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:06:21,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:06:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:06:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:06:21,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:21,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:06:21,697 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:06:21,697 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:06:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,699 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:06:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:06:21,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,700 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:06:21,700 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:06:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:21,701 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:06:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:06:21,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:21,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:21,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:21,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:06:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:06:21,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-11-23 12:06:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:21,705 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:06:21,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:06:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:06:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:06:21,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:21,706 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:21,706 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:21,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1052740146, now seen corresponding path program 6 times [2018-11-23 12:06:21,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {1150#true} call ULTIMATE.init(); {1150#true} is VALID [2018-11-23 12:06:21,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {1150#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1150#true} is VALID [2018-11-23 12:06:21,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {1150#true} assume true; {1150#true} is VALID [2018-11-23 12:06:21,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1150#true} {1150#true} #48#return; {1150#true} is VALID [2018-11-23 12:06:21,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {1150#true} call #t~ret4 := main(); {1150#true} is VALID [2018-11-23 12:06:21,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {1150#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1152#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {1152#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1153#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {1153#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1154#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {1154#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1155#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1156#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1157#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {1157#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1158#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {1158#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1151#false} is VALID [2018-11-23 12:06:21,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {1151#false} havoc ~x~0;~x~0 := 1; {1151#false} is VALID [2018-11-23 12:06:21,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1151#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1151#false} is VALID [2018-11-23 12:06:21,880 INFO L256 TraceCheckUtils]: 15: Hoare triple {1151#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1151#false} is VALID [2018-11-23 12:06:21,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {1151#false} ~cond := #in~cond; {1151#false} is VALID [2018-11-23 12:06:21,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {1151#false} assume 0 == ~cond; {1151#false} is VALID [2018-11-23 12:06:21,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2018-11-23 12:06:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:21,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:21,979 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:06:21,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:22,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1150#true} call ULTIMATE.init(); {1150#true} is VALID [2018-11-23 12:06:22,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {1150#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1150#true} is VALID [2018-11-23 12:06:22,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {1150#true} assume true; {1150#true} is VALID [2018-11-23 12:06:22,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1150#true} {1150#true} #48#return; {1150#true} is VALID [2018-11-23 12:06:22,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {1150#true} call #t~ret4 := main(); {1150#true} is VALID [2018-11-23 12:06:22,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {1150#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1152#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {1152#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1153#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {1153#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1154#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {1154#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1155#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1156#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1157#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {1157#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1158#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {1158#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1151#false} is VALID [2018-11-23 12:06:22,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {1151#false} havoc ~x~0;~x~0 := 1; {1151#false} is VALID [2018-11-23 12:06:22,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {1151#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1151#false} is VALID [2018-11-23 12:06:22,275 INFO L256 TraceCheckUtils]: 15: Hoare triple {1151#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1151#false} is VALID [2018-11-23 12:06:22,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1151#false} ~cond := #in~cond; {1151#false} is VALID [2018-11-23 12:06:22,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {1151#false} assume 0 == ~cond; {1151#false} is VALID [2018-11-23 12:06:22,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2018-11-23 12:06:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:22,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:22,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 12:06:22,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 12:06:22,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:22,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:06:22,317 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 12:06:22,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:06:22,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:06:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:06:22,319 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-23 12:06:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,514 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:06:22,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:06:22,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 12:06:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:06:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 12:06:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:06:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 12:06:22,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2018-11-23 12:06:22,573 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 12:06:22,574 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:06:22,574 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:06:22,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:06:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:06:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:06:22,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:06:22,589 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:06:22,589 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:06:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,591 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:06:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:06:22,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,592 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:06:22,592 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:06:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,594 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:06:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:06:22,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:06:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 12:06:22,596 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-23 12:06:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,597 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 12:06:22,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:06:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:06:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:06:22,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:22,598 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:22,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:22,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash 479094766, now seen corresponding path program 7 times [2018-11-23 12:06:22,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2018-11-23 12:06:22,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1359#true} is VALID [2018-11-23 12:06:22,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2018-11-23 12:06:22,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #48#return; {1359#true} is VALID [2018-11-23 12:06:22,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret4 := main(); {1359#true} is VALID [2018-11-23 12:06:22,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {1359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1361#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {1361#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1362#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {1362#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1363#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {1363#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1364#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {1364#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1365#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {1365#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1366#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1367#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1368#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:22,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {1368#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1360#false} is VALID [2018-11-23 12:06:22,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {1360#false} havoc ~x~0;~x~0 := 1; {1360#false} is VALID [2018-11-23 12:06:22,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {1360#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1360#false} is VALID [2018-11-23 12:06:22,754 INFO L256 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1360#false} is VALID [2018-11-23 12:06:22,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2018-11-23 12:06:22,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2018-11-23 12:06:22,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2018-11-23 12:06:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:22,756 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 12:06:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:22,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:22,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2018-11-23 12:06:22,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1359#true} is VALID [2018-11-23 12:06:22,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2018-11-23 12:06:22,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #48#return; {1359#true} is VALID [2018-11-23 12:06:22,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret4 := main(); {1359#true} is VALID [2018-11-23 12:06:22,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {1359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1361#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:22,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {1361#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1362#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:22,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {1362#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1363#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:22,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {1363#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1364#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:22,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {1364#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1365#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:22,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {1365#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1366#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:22,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1367#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:22,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1368#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:22,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {1368#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1360#false} is VALID [2018-11-23 12:06:22,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1360#false} havoc ~x~0;~x~0 := 1; {1360#false} is VALID [2018-11-23 12:06:22,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {1360#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1360#false} is VALID [2018-11-23 12:06:22,923 INFO L256 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1360#false} is VALID [2018-11-23 12:06:22,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2018-11-23 12:06:22,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2018-11-23 12:06:22,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2018-11-23 12:06:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:22,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:22,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 12:06:22,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:06:22,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:22,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:06:22,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:22,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:06:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:06:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:22,968 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2018-11-23 12:06:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,387 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:06:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:06:23,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:06:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:06:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:06:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:06:23,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 12:06:23,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,461 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:06:23,461 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:06:23,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:06:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:06:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:06:23,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:23,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:06:23,490 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:06:23,491 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:06:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,492 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:06:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:06:23,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,493 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:06:23,493 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:06:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,495 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:06:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:06:23,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:23,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:06:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 12:06:23,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-11-23 12:06:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:23,498 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 12:06:23,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:06:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:06:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:06:23,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:23,499 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:23,499 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:23,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -124042830, now seen corresponding path program 8 times [2018-11-23 12:06:23,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {1578#true} call ULTIMATE.init(); {1578#true} is VALID [2018-11-23 12:06:23,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {1578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1578#true} is VALID [2018-11-23 12:06:23,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {1578#true} assume true; {1578#true} is VALID [2018-11-23 12:06:23,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1578#true} {1578#true} #48#return; {1578#true} is VALID [2018-11-23 12:06:23,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {1578#true} call #t~ret4 := main(); {1578#true} is VALID [2018-11-23 12:06:23,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {1578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1580#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:23,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {1580#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1581#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:23,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {1581#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1582#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:23,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {1582#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1583#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:23,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {1583#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1584#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:23,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {1584#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1585#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:23,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {1585#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1586#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:23,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {1586#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1587#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:23,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {1587#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1588#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:23,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {1588#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1579#false} is VALID [2018-11-23 12:06:23,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {1579#false} havoc ~x~0;~x~0 := 1; {1579#false} is VALID [2018-11-23 12:06:23,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {1579#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1579#false} is VALID [2018-11-23 12:06:23,738 INFO L256 TraceCheckUtils]: 17: Hoare triple {1579#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1579#false} is VALID [2018-11-23 12:06:23,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {1579#false} ~cond := #in~cond; {1579#false} is VALID [2018-11-23 12:06:23,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {1579#false} assume 0 == ~cond; {1579#false} is VALID [2018-11-23 12:06:23,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#false} assume !false; {1579#false} is VALID [2018-11-23 12:06:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:23,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:23,740 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 12:06:23,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:23,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:23,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:23,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:23,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {1578#true} call ULTIMATE.init(); {1578#true} is VALID [2018-11-23 12:06:23,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {1578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1578#true} is VALID [2018-11-23 12:06:23,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {1578#true} assume true; {1578#true} is VALID [2018-11-23 12:06:23,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1578#true} {1578#true} #48#return; {1578#true} is VALID [2018-11-23 12:06:23,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {1578#true} call #t~ret4 := main(); {1578#true} is VALID [2018-11-23 12:06:23,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {1578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1580#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:23,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {1580#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1581#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:23,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {1581#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1582#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:23,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {1582#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1583#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:23,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {1583#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1584#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:23,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {1584#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1585#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:23,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {1585#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1586#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:23,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {1586#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1587#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:23,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {1587#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1588#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:23,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {1588#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1579#false} is VALID [2018-11-23 12:06:23,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {1579#false} havoc ~x~0;~x~0 := 1; {1579#false} is VALID [2018-11-23 12:06:23,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {1579#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1579#false} is VALID [2018-11-23 12:06:23,945 INFO L256 TraceCheckUtils]: 17: Hoare triple {1579#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1579#false} is VALID [2018-11-23 12:06:23,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {1579#false} ~cond := #in~cond; {1579#false} is VALID [2018-11-23 12:06:23,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {1579#false} assume 0 == ~cond; {1579#false} is VALID [2018-11-23 12:06:23,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#false} assume !false; {1579#false} is VALID [2018-11-23 12:06:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:23,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:23,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 12:06:23,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-11-23 12:06:23,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:23,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:06:23,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:06:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:06:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:23,994 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2018-11-23 12:06:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,122 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:06:24,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:06:24,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-11-23 12:06:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 12:06:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:06:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 12:06:24,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2018-11-23 12:06:24,233 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 12:06:24,234 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:06:24,234 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:06:24,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:06:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:06:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:06:24,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:24,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:24,311 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:24,311 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,312 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:06:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:06:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,313 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:24,313 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:06:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:24,314 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:06:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:06:24,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:24,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:24,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:24,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:06:24,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-11-23 12:06:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:24,316 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:06:24,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:06:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:06:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:06:24,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:24,317 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:24,317 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:24,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1641439122, now seen corresponding path program 9 times [2018-11-23 12:06:24,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:24,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:24,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2018-11-23 12:06:25,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {1807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1807#true} is VALID [2018-11-23 12:06:25,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2018-11-23 12:06:25,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #48#return; {1807#true} is VALID [2018-11-23 12:06:25,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret4 := main(); {1807#true} is VALID [2018-11-23 12:06:25,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {1807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1809#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {1809#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1810#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {1810#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1811#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {1811#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1812#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:25,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1813#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:25,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1814#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:25,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {1814#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1815#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:25,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {1815#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1816#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:25,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1817#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:25,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {1817#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1818#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:25,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {1818#(<= main_~i~0 10)} assume !(~i~0 < 100000); {1808#false} is VALID [2018-11-23 12:06:25,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {1808#false} havoc ~x~0;~x~0 := 1; {1808#false} is VALID [2018-11-23 12:06:25,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {1808#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1808#false} is VALID [2018-11-23 12:06:25,113 INFO L256 TraceCheckUtils]: 18: Hoare triple {1808#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1808#false} is VALID [2018-11-23 12:06:25,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {1808#false} ~cond := #in~cond; {1808#false} is VALID [2018-11-23 12:06:25,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {1808#false} assume 0 == ~cond; {1808#false} is VALID [2018-11-23 12:06:25,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2018-11-23 12:06:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:25,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:25,115 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 12:06:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:25,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:06:25,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:25,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:25,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2018-11-23 12:06:25,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {1807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1807#true} is VALID [2018-11-23 12:06:25,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2018-11-23 12:06:25,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #48#return; {1807#true} is VALID [2018-11-23 12:06:25,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret4 := main(); {1807#true} is VALID [2018-11-23 12:06:25,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {1807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {1809#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:25,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {1809#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1810#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:25,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {1810#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1811#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:25,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {1811#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1812#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:25,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1813#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:25,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1814#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:25,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {1814#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1815#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:25,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {1815#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1816#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:25,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1817#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:25,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {1817#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {1818#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:25,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {1818#(<= main_~i~0 10)} assume !(~i~0 < 100000); {1808#false} is VALID [2018-11-23 12:06:25,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {1808#false} havoc ~x~0;~x~0 := 1; {1808#false} is VALID [2018-11-23 12:06:25,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {1808#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {1808#false} is VALID [2018-11-23 12:06:25,329 INFO L256 TraceCheckUtils]: 18: Hoare triple {1808#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {1808#false} is VALID [2018-11-23 12:06:25,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {1808#false} ~cond := #in~cond; {1808#false} is VALID [2018-11-23 12:06:25,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1808#false} assume 0 == ~cond; {1808#false} is VALID [2018-11-23 12:06:25,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2018-11-23 12:06:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:25,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:25,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 12:06:25,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 12:06:25,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:25,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:06:25,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:25,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:06:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:06:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:25,370 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 12 states. [2018-11-23 12:06:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,770 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:06:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:06:25,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 12:06:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:06:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:06:25,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 12:06:25,856 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 12:06:25,857 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:06:25,857 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:06:25,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:06:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:06:25,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:25,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:25,874 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:25,874 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,875 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:06:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:06:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,876 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:25,876 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:06:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:25,877 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:06:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:06:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:25,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:25,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:25,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:06:25,879 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-11-23 12:06:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:06:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:06:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:06:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:06:25,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:25,880 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:25,880 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 10 times [2018-11-23 12:06:25,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {2046#true} call ULTIMATE.init(); {2046#true} is VALID [2018-11-23 12:06:26,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {2046#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2046#true} is VALID [2018-11-23 12:06:26,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {2046#true} assume true; {2046#true} is VALID [2018-11-23 12:06:26,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2046#true} {2046#true} #48#return; {2046#true} is VALID [2018-11-23 12:06:26,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {2046#true} call #t~ret4 := main(); {2046#true} is VALID [2018-11-23 12:06:26,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {2046#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2048#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {2048#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2049#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {2049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2050#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {2050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2051#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {2051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2052#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:26,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {2052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2053#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:26,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {2053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2054#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:26,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {2054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:26,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:26,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2057#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:26,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {2057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:26,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {2058#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2047#false} is VALID [2018-11-23 12:06:26,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {2047#false} havoc ~x~0;~x~0 := 1; {2047#false} is VALID [2018-11-23 12:06:26,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {2047#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2047#false} is VALID [2018-11-23 12:06:26,193 INFO L256 TraceCheckUtils]: 19: Hoare triple {2047#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2047#false} is VALID [2018-11-23 12:06:26,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {2047#false} ~cond := #in~cond; {2047#false} is VALID [2018-11-23 12:06:26,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {2047#false} assume 0 == ~cond; {2047#false} is VALID [2018-11-23 12:06:26,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {2047#false} assume !false; {2047#false} is VALID [2018-11-23 12:06:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:26,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:26,195 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 12:06:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:26,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:26,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:26,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:26,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {2046#true} call ULTIMATE.init(); {2046#true} is VALID [2018-11-23 12:06:26,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {2046#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2046#true} is VALID [2018-11-23 12:06:26,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {2046#true} assume true; {2046#true} is VALID [2018-11-23 12:06:26,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2046#true} {2046#true} #48#return; {2046#true} is VALID [2018-11-23 12:06:26,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {2046#true} call #t~ret4 := main(); {2046#true} is VALID [2018-11-23 12:06:26,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {2046#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2048#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {2048#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2049#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {2049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2050#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {2050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2051#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {2051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2052#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:26,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {2052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2053#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:26,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {2053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2054#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:26,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {2054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2055#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:26,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2056#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:26,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2057#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:26,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {2057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:26,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {2058#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2047#false} is VALID [2018-11-23 12:06:26,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {2047#false} havoc ~x~0;~x~0 := 1; {2047#false} is VALID [2018-11-23 12:06:26,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {2047#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2047#false} is VALID [2018-11-23 12:06:26,499 INFO L256 TraceCheckUtils]: 19: Hoare triple {2047#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2047#false} is VALID [2018-11-23 12:06:26,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {2047#false} ~cond := #in~cond; {2047#false} is VALID [2018-11-23 12:06:26,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {2047#false} assume 0 == ~cond; {2047#false} is VALID [2018-11-23 12:06:26,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {2047#false} assume !false; {2047#false} is VALID [2018-11-23 12:06:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 12:06:26,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-23 12:06:26,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:26,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:06:26,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:06:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:06:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:26,540 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2018-11-23 12:06:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,753 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:06:26,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:06:26,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-23 12:06:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 12:06:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:06:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 12:06:26,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 12:06:26,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,797 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:06:26,797 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:06:26,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:06:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:06:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:06:26,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:26,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:26,828 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:26,828 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,829 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:06:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:06:26,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,830 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:26,830 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:06:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:26,831 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:06:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:06:26,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:26,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:26,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:26,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:06:26,833 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2018-11-23 12:06:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:26,833 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:06:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:06:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:06:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:06:26,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:26,834 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:26,834 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:26,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 634960110, now seen corresponding path program 11 times [2018-11-23 12:06:26,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-23 12:06:27,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-23 12:06:27,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-23 12:06:27,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #48#return; {2295#true} is VALID [2018-11-23 12:06:27,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret4 := main(); {2295#true} is VALID [2018-11-23 12:06:27,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2297#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {2297#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2298#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {2298#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2299#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {2299#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2300#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {2300#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2301#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {2301#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2302#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {2302#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2303#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {2303#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2304#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {2304#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2305#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2306#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {2306#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2307#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {2307#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {2308#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2296#false} is VALID [2018-11-23 12:06:27,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {2296#false} havoc ~x~0;~x~0 := 1; {2296#false} is VALID [2018-11-23 12:06:27,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {2296#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2296#false} is VALID [2018-11-23 12:06:27,383 INFO L256 TraceCheckUtils]: 20: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2296#false} is VALID [2018-11-23 12:06:27,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-23 12:06:27,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {2296#false} assume 0 == ~cond; {2296#false} is VALID [2018-11-23 12:06:27,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-23 12:06:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:27,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:27,385 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 12:06:27,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:27,471 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:06:27,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:27,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:27,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-23 12:06:27,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-23 12:06:27,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-23 12:06:27,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #48#return; {2295#true} is VALID [2018-11-23 12:06:27,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret4 := main(); {2295#true} is VALID [2018-11-23 12:06:27,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2297#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {2297#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2298#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:27,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {2298#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2299#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:27,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {2299#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2300#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:27,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {2300#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2301#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:27,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {2301#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2302#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:27,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {2302#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2303#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:27,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {2303#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2304#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:27,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {2304#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2305#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:27,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2306#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:27,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {2306#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2307#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:27,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {2307#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:27,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {2308#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2296#false} is VALID [2018-11-23 12:06:27,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {2296#false} havoc ~x~0;~x~0 := 1; {2296#false} is VALID [2018-11-23 12:06:27,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {2296#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2296#false} is VALID [2018-11-23 12:06:27,734 INFO L256 TraceCheckUtils]: 20: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2296#false} is VALID [2018-11-23 12:06:27,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-23 12:06:27,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {2296#false} assume 0 == ~cond; {2296#false} is VALID [2018-11-23 12:06:27,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-23 12:06:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:27,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:27,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 12:06:27,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 12:06:27,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:27,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:06:27,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:27,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:06:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:06:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:27,797 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-11-23 12:06:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,936 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 12:06:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:06:27,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 12:06:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 12:06:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 12:06:27,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2018-11-23 12:06:27,988 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 12:06:27,988 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:06:27,988 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:06:27,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:06:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:06:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:06:28,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:28,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 12:06:28,010 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:06:28,010 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:06:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,011 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:06:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:06:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:28,011 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:06:28,011 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:06:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:28,012 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:06:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:06:28,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:28,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:28,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:28,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:06:28,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-11-23 12:06:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:28,014 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:06:28,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:06:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:06:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:06:28,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:28,015 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:28,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:28,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 412815538, now seen corresponding path program 12 times [2018-11-23 12:06:28,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:28,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {2554#true} call ULTIMATE.init(); {2554#true} is VALID [2018-11-23 12:06:28,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {2554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2554#true} is VALID [2018-11-23 12:06:28,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {2554#true} assume true; {2554#true} is VALID [2018-11-23 12:06:28,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2554#true} {2554#true} #48#return; {2554#true} is VALID [2018-11-23 12:06:28,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {2554#true} call #t~ret4 := main(); {2554#true} is VALID [2018-11-23 12:06:28,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {2554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2556#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {2556#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2557#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {2557#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2558#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {2558#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2559#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2560#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {2560#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2561#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {2561#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2562#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:28,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {2562#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2563#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:28,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {2563#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2564#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:28,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2565#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:28,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {2565#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2566#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:28,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {2566#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2567#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:28,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {2567#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2568#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:28,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {2568#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2555#false} is VALID [2018-11-23 12:06:28,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {2555#false} havoc ~x~0;~x~0 := 1; {2555#false} is VALID [2018-11-23 12:06:28,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {2555#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2555#false} is VALID [2018-11-23 12:06:28,539 INFO L256 TraceCheckUtils]: 21: Hoare triple {2555#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2555#false} is VALID [2018-11-23 12:06:28,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {2555#false} ~cond := #in~cond; {2555#false} is VALID [2018-11-23 12:06:28,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {2555#false} assume 0 == ~cond; {2555#false} is VALID [2018-11-23 12:06:28,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {2555#false} assume !false; {2555#false} is VALID [2018-11-23 12:06:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:28,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:28,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:06:28,550 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:28,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:06:28,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:28,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:28,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {2554#true} call ULTIMATE.init(); {2554#true} is VALID [2018-11-23 12:06:28,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {2554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2554#true} is VALID [2018-11-23 12:06:28,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {2554#true} assume true; {2554#true} is VALID [2018-11-23 12:06:28,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2554#true} {2554#true} #48#return; {2554#true} is VALID [2018-11-23 12:06:28,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {2554#true} call #t~ret4 := main(); {2554#true} is VALID [2018-11-23 12:06:28,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {2554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2556#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:28,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {2556#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2557#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:28,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {2557#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2558#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:28,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {2558#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2559#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:28,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2560#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:28,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {2560#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2561#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:28,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {2561#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2562#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:28,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {2562#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2563#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:28,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {2563#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2564#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:28,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2565#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:28,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {2565#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2566#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:28,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {2566#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2567#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:28,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {2567#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2568#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:28,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {2568#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2555#false} is VALID [2018-11-23 12:06:28,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {2555#false} havoc ~x~0;~x~0 := 1; {2555#false} is VALID [2018-11-23 12:06:28,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {2555#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2555#false} is VALID [2018-11-23 12:06:28,774 INFO L256 TraceCheckUtils]: 21: Hoare triple {2555#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2555#false} is VALID [2018-11-23 12:06:28,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {2555#false} ~cond := #in~cond; {2555#false} is VALID [2018-11-23 12:06:28,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {2555#false} assume 0 == ~cond; {2555#false} is VALID [2018-11-23 12:06:28,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {2555#false} assume !false; {2555#false} is VALID [2018-11-23 12:06:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 12:06:28,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 12:06:28,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:28,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:06:28,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:28,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:06:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:06:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:28,822 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-11-23 12:06:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,024 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:06:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:06:29,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 12:06:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 12:06:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 12:06:29,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-23 12:06:29,069 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 12:06:29,070 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:06:29,070 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:06:29,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:06:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:06:29,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:29,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:06:29,111 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:06:29,111 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:06:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,112 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:06:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:06:29,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,113 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:06:29,113 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:06:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:29,114 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:06:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:06:29,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:29,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:29,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:29,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:06:29,115 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-11-23 12:06:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:29,115 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:06:29,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:06:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:06:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:06:29,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:29,116 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:29,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:29,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2116268398, now seen corresponding path program 13 times [2018-11-23 12:06:29,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:29,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {2823#true} call ULTIMATE.init(); {2823#true} is VALID [2018-11-23 12:06:29,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {2823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2823#true} is VALID [2018-11-23 12:06:29,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {2823#true} assume true; {2823#true} is VALID [2018-11-23 12:06:29,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2823#true} {2823#true} #48#return; {2823#true} is VALID [2018-11-23 12:06:29,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {2823#true} call #t~ret4 := main(); {2823#true} is VALID [2018-11-23 12:06:29,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {2823#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2825#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {2825#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2826#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {2826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2827#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {2827#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2828#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2828#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2829#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {2829#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2830#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {2830#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2831#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {2831#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2832#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {2832#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2833#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {2833#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2834#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {2834#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2835#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {2835#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2836#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {2836#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2837#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {2837#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {2838#(<= main_~i~0 14)} assume !(~i~0 < 100000); {2824#false} is VALID [2018-11-23 12:06:29,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {2824#false} havoc ~x~0;~x~0 := 1; {2824#false} is VALID [2018-11-23 12:06:29,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {2824#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2824#false} is VALID [2018-11-23 12:06:29,389 INFO L256 TraceCheckUtils]: 22: Hoare triple {2824#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2824#false} is VALID [2018-11-23 12:06:29,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {2824#false} ~cond := #in~cond; {2824#false} is VALID [2018-11-23 12:06:29,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {2824#false} assume 0 == ~cond; {2824#false} is VALID [2018-11-23 12:06:29,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {2824#false} assume !false; {2824#false} is VALID [2018-11-23 12:06:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:29,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:29,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {2823#true} call ULTIMATE.init(); {2823#true} is VALID [2018-11-23 12:06:29,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {2823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2823#true} is VALID [2018-11-23 12:06:29,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {2823#true} assume true; {2823#true} is VALID [2018-11-23 12:06:29,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2823#true} {2823#true} #48#return; {2823#true} is VALID [2018-11-23 12:06:29,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {2823#true} call #t~ret4 := main(); {2823#true} is VALID [2018-11-23 12:06:29,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {2823#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {2825#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {2825#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2826#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {2826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2827#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {2827#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2828#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {2828#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2829#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {2829#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2830#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {2830#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2831#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {2831#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2832#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {2832#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2833#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {2833#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2834#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {2834#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2835#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {2835#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2836#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {2836#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2837#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {2837#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {2838#(<= main_~i~0 14)} assume !(~i~0 < 100000); {2824#false} is VALID [2018-11-23 12:06:29,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {2824#false} havoc ~x~0;~x~0 := 1; {2824#false} is VALID [2018-11-23 12:06:29,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {2824#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {2824#false} is VALID [2018-11-23 12:06:29,730 INFO L256 TraceCheckUtils]: 22: Hoare triple {2824#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {2824#false} is VALID [2018-11-23 12:06:29,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {2824#false} ~cond := #in~cond; {2824#false} is VALID [2018-11-23 12:06:29,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {2824#false} assume 0 == ~cond; {2824#false} is VALID [2018-11-23 12:06:29,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {2824#false} assume !false; {2824#false} is VALID [2018-11-23 12:06:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:29,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 12:06:29,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-23 12:06:29,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:29,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:06:29,773 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 12:06:29,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:06:29,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:06:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:06:29,775 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-11-23 12:06:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,018 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 12:06:30,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:06:30,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-23 12:06:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 12:06:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 12:06:30,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2018-11-23 12:06:30,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:30,060 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:06:30,060 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:06:30,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:06:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:06:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:06:30,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:30,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:06:30,097 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:06:30,097 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:06:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,098 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:06:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:06:30,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,098 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:06:30,098 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:06:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:30,099 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:06:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:06:30,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:30,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:30,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:30,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:06:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 12:06:30,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-23 12:06:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:30,100 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 12:06:30,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:06:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:06:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:06:30,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:30,101 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:30,101 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:30,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -911267790, now seen corresponding path program 14 times [2018-11-23 12:06:30,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:30,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {3102#true} call ULTIMATE.init(); {3102#true} is VALID [2018-11-23 12:06:31,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {3102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3102#true} is VALID [2018-11-23 12:06:31,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {3102#true} assume true; {3102#true} is VALID [2018-11-23 12:06:31,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3102#true} {3102#true} #48#return; {3102#true} is VALID [2018-11-23 12:06:31,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {3102#true} call #t~ret4 := main(); {3102#true} is VALID [2018-11-23 12:06:31,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {3102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3104#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {3104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3105#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {3105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {3106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3107#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {3107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3108#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {3108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3109#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {3109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3110#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {3110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3111#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3112#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3113#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {3113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3114#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3115#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {3115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3116#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {3116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3117#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {3117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3118#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {3118#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3103#false} is VALID [2018-11-23 12:06:31,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {3103#false} havoc ~x~0;~x~0 := 1; {3103#false} is VALID [2018-11-23 12:06:31,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {3103#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3103#false} is VALID [2018-11-23 12:06:31,174 INFO L256 TraceCheckUtils]: 23: Hoare triple {3103#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3103#false} is VALID [2018-11-23 12:06:31,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {3103#false} ~cond := #in~cond; {3103#false} is VALID [2018-11-23 12:06:31,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {3103#false} assume 0 == ~cond; {3103#false} is VALID [2018-11-23 12:06:31,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {3103#false} assume !false; {3103#false} is VALID [2018-11-23 12:06:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:31,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:31,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:31,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:31,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:31,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:31,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {3102#true} call ULTIMATE.init(); {3102#true} is VALID [2018-11-23 12:06:31,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {3102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3102#true} is VALID [2018-11-23 12:06:31,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {3102#true} assume true; {3102#true} is VALID [2018-11-23 12:06:31,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3102#true} {3102#true} #48#return; {3102#true} is VALID [2018-11-23 12:06:31,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {3102#true} call #t~ret4 := main(); {3102#true} is VALID [2018-11-23 12:06:31,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {3102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3104#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:31,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {3104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3105#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:31,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {3105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:31,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {3106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3107#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:31,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {3107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3108#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:31,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {3108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3109#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:31,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {3109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3110#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:31,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3111#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:31,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3112#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:31,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3113#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:31,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {3113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3114#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:31,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3115#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:31,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {3115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3116#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:31,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {3116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3117#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:31,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {3117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3118#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:31,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {3118#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3103#false} is VALID [2018-11-23 12:06:31,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {3103#false} havoc ~x~0;~x~0 := 1; {3103#false} is VALID [2018-11-23 12:06:31,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {3103#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3103#false} is VALID [2018-11-23 12:06:31,373 INFO L256 TraceCheckUtils]: 23: Hoare triple {3103#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3103#false} is VALID [2018-11-23 12:06:31,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {3103#false} ~cond := #in~cond; {3103#false} is VALID [2018-11-23 12:06:31,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {3103#false} assume 0 == ~cond; {3103#false} is VALID [2018-11-23 12:06:31,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {3103#false} assume !false; {3103#false} is VALID [2018-11-23 12:06:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:31,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 12:06:31,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-23 12:06:31,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:31,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:06:31,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:06:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:06:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:31,465 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2018-11-23 12:06:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,730 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:06:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:06:31,731 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-23 12:06:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 12:06:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:06:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 12:06:31,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 46 transitions. [2018-11-23 12:06:31,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:31,776 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:06:31,776 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:06:31,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:06:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:06:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:06:31,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:31,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 12:06:31,801 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:06:31,801 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:06:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,803 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:06:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:06:31,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,804 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:06:31,804 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:06:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:31,805 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:06:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:06:31,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:31,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:31,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:31,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:06:31,807 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2018-11-23 12:06:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:31,807 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:06:31,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:06:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:06:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:06:31,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:31,808 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:31,809 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:31,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -275609106, now seen corresponding path program 15 times [2018-11-23 12:06:31,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:31,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:31,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:31,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:32,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {3391#true} call ULTIMATE.init(); {3391#true} is VALID [2018-11-23 12:06:32,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {3391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3391#true} is VALID [2018-11-23 12:06:32,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {3391#true} assume true; {3391#true} is VALID [2018-11-23 12:06:32,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3391#true} {3391#true} #48#return; {3391#true} is VALID [2018-11-23 12:06:32,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {3391#true} call #t~ret4 := main(); {3391#true} is VALID [2018-11-23 12:06:32,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {3391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3393#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:32,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {3393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3394#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:32,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {3394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3395#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:32,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {3395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3396#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:32,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {3396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3397#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:32,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {3397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3398#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:32,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {3398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3399#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:32,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {3399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3400#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:32,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {3400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3401#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:32,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {3401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3402#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:32,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {3402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3403#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:32,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {3403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3404#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:32,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3405#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:32,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3406#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:32,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {3406#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3407#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:32,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {3407#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3408#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:32,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {3408#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3392#false} is VALID [2018-11-23 12:06:32,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {3392#false} havoc ~x~0;~x~0 := 1; {3392#false} is VALID [2018-11-23 12:06:32,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {3392#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3392#false} is VALID [2018-11-23 12:06:32,151 INFO L256 TraceCheckUtils]: 24: Hoare triple {3392#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3392#false} is VALID [2018-11-23 12:06:32,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {3392#false} ~cond := #in~cond; {3392#false} is VALID [2018-11-23 12:06:32,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {3392#false} assume 0 == ~cond; {3392#false} is VALID [2018-11-23 12:06:32,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {3392#false} assume !false; {3392#false} is VALID [2018-11-23 12:06:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:32,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:32,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:32,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:32,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:06:32,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:32,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:32,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {3391#true} call ULTIMATE.init(); {3391#true} is VALID [2018-11-23 12:06:32,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {3391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3391#true} is VALID [2018-11-23 12:06:32,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {3391#true} assume true; {3391#true} is VALID [2018-11-23 12:06:32,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3391#true} {3391#true} #48#return; {3391#true} is VALID [2018-11-23 12:06:32,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {3391#true} call #t~ret4 := main(); {3391#true} is VALID [2018-11-23 12:06:32,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {3391#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3393#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:32,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {3393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3394#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:32,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {3394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3395#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:32,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {3395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3396#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:32,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {3396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3397#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:32,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {3397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3398#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:32,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {3398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3399#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:32,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {3399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3400#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:32,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {3400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3401#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:32,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {3401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3402#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:32,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {3402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3403#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:32,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {3403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3404#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:32,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3405#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:32,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3406#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:32,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {3406#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3407#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:32,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {3407#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3408#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:32,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {3408#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3392#false} is VALID [2018-11-23 12:06:32,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {3392#false} havoc ~x~0;~x~0 := 1; {3392#false} is VALID [2018-11-23 12:06:32,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {3392#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3392#false} is VALID [2018-11-23 12:06:32,559 INFO L256 TraceCheckUtils]: 24: Hoare triple {3392#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3392#false} is VALID [2018-11-23 12:06:32,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {3392#false} ~cond := #in~cond; {3392#false} is VALID [2018-11-23 12:06:32,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {3392#false} assume 0 == ~cond; {3392#false} is VALID [2018-11-23 12:06:32,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {3392#false} assume !false; {3392#false} is VALID [2018-11-23 12:06:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:32,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:32,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 12:06:32,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-11-23 12:06:32,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:32,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:06:32,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:32,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:06:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:06:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:06:32,626 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-11-23 12:06:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:32,898 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:06:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:06:32,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-11-23 12:06:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 12:06:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 12:06:32,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2018-11-23 12:06:32,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:32,956 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:06:32,956 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:06:32,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:06:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:06:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:06:33,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:33,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:06:33,000 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:06:33,000 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:06:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:33,001 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:06:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:06:33,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:33,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:33,002 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:06:33,002 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:06:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:33,003 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:06:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:06:33,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:33,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:33,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:33,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:06:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 12:06:33,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-11-23 12:06:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:33,005 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 12:06:33,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:06:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:06:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:06:33,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:33,005 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:33,005 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:33,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2045026382, now seen corresponding path program 16 times [2018-11-23 12:06:33,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:33,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:33,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:33,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 12:06:33,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3690#true} is VALID [2018-11-23 12:06:33,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 12:06:33,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3690#true} {3690#true} #48#return; {3690#true} is VALID [2018-11-23 12:06:33,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {3690#true} call #t~ret4 := main(); {3690#true} is VALID [2018-11-23 12:06:33,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {3690#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3692#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {3692#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3693#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {3693#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3694#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {3694#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3695#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {3695#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3696#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {3696#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3697#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {3697#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3698#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {3698#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3699#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {3699#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3700#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3701#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:33,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {3701#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3702#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:33,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {3702#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3703#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:33,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {3703#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3704#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:33,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {3704#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3705#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:33,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {3705#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3706#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:33,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {3706#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3707#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:33,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {3707#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3708#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:33,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {3708#(<= main_~i~0 17)} assume !(~i~0 < 100000); {3691#false} is VALID [2018-11-23 12:06:33,446 INFO L273 TraceCheckUtils]: 23: Hoare triple {3691#false} havoc ~x~0;~x~0 := 1; {3691#false} is VALID [2018-11-23 12:06:33,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {3691#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3691#false} is VALID [2018-11-23 12:06:33,446 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3691#false} is VALID [2018-11-23 12:06:33,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 12:06:33,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 12:06:33,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 12:06:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:33,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:33,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:33,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:33,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:33,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:33,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:33,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 12:06:33,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3690#true} is VALID [2018-11-23 12:06:33,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 12:06:33,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3690#true} {3690#true} #48#return; {3690#true} is VALID [2018-11-23 12:06:33,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {3690#true} call #t~ret4 := main(); {3690#true} is VALID [2018-11-23 12:06:33,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {3690#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {3692#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:33,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {3692#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3693#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:33,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {3693#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3694#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:33,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {3694#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3695#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:33,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {3695#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3696#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:33,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {3696#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3697#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:33,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {3697#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3698#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:33,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {3698#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3699#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:33,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {3699#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3700#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:33,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3701#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:33,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {3701#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3702#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:33,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {3702#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3703#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:33,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {3703#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3704#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:33,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {3704#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3705#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:33,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {3705#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3706#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:33,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {3706#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3707#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:33,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {3707#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {3708#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:33,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {3708#(<= main_~i~0 17)} assume !(~i~0 < 100000); {3691#false} is VALID [2018-11-23 12:06:33,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3691#false} havoc ~x~0;~x~0 := 1; {3691#false} is VALID [2018-11-23 12:06:33,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {3691#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {3691#false} is VALID [2018-11-23 12:06:33,752 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {3691#false} is VALID [2018-11-23 12:06:33,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 12:06:33,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 12:06:33,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 12:06:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:33,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:33,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 12:06:33,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 12:06:33,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:33,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:06:33,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:33,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:06:33,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:06:33,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:06:33,800 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 19 states. [2018-11-23 12:06:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,077 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:06:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:06:34,077 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 12:06:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 12:06:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 12:06:34,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2018-11-23 12:06:34,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:34,463 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:06:34,463 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:06:34,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:06:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:06:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:06:34,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:34,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:06:34,487 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:06:34,488 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:06:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,488 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:06:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:06:34,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:34,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:34,489 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:06:34,489 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:06:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:34,490 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:06:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:06:34,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:34,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:34,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:34,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:06:34,491 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-11-23 12:06:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:34,491 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:06:34,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:06:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:06:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:06:34,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:34,492 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:34,492 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:34,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1062387090, now seen corresponding path program 17 times [2018-11-23 12:06:34,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:34,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:34,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2018-11-23 12:06:34,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3999#true} is VALID [2018-11-23 12:06:34,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 12:06:34,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #48#return; {3999#true} is VALID [2018-11-23 12:06:34,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret4 := main(); {3999#true} is VALID [2018-11-23 12:06:34,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {3999#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4001#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:34,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {4001#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4002#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:34,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {4002#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4003#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:34,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {4003#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4004#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:34,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {4004#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4005#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:34,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {4005#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4006#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:34,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {4006#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4007#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:34,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {4007#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4008#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:34,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {4008#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4009#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:34,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {4009#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4010#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:34,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {4010#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4011#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:34,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {4011#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4012#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:34,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {4012#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4013#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:34,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {4013#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4014#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:34,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {4014#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4015#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:34,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {4015#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4016#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:34,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {4016#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4017#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:34,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {4017#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4018#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:34,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {4018#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4000#false} is VALID [2018-11-23 12:06:34,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {4000#false} havoc ~x~0;~x~0 := 1; {4000#false} is VALID [2018-11-23 12:06:34,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {4000#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4000#false} is VALID [2018-11-23 12:06:34,805 INFO L256 TraceCheckUtils]: 26: Hoare triple {4000#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4000#false} is VALID [2018-11-23 12:06:34,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {4000#false} ~cond := #in~cond; {4000#false} is VALID [2018-11-23 12:06:34,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {4000#false} assume 0 == ~cond; {4000#false} is VALID [2018-11-23 12:06:34,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2018-11-23 12:06:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:34,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:34,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:34,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:35,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:06:35,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:35,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:35,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2018-11-23 12:06:35,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3999#true} is VALID [2018-11-23 12:06:35,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 12:06:35,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #48#return; {3999#true} is VALID [2018-11-23 12:06:35,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret4 := main(); {3999#true} is VALID [2018-11-23 12:06:35,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {3999#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4001#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {4001#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4002#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {4002#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4003#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {4003#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4004#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {4004#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4005#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {4005#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4006#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {4006#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4007#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {4007#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4008#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {4008#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4009#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {4009#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4010#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {4010#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4011#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {4011#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4012#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {4012#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4013#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {4013#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4014#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {4014#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4015#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:35,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {4015#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4016#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:35,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {4016#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4017#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:35,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {4017#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4018#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:35,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {4018#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4000#false} is VALID [2018-11-23 12:06:35,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {4000#false} havoc ~x~0;~x~0 := 1; {4000#false} is VALID [2018-11-23 12:06:35,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {4000#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4000#false} is VALID [2018-11-23 12:06:35,229 INFO L256 TraceCheckUtils]: 26: Hoare triple {4000#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4000#false} is VALID [2018-11-23 12:06:35,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {4000#false} ~cond := #in~cond; {4000#false} is VALID [2018-11-23 12:06:35,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {4000#false} assume 0 == ~cond; {4000#false} is VALID [2018-11-23 12:06:35,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2018-11-23 12:06:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:35,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:35,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 12:06:35,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-23 12:06:35,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:35,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:06:35,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:35,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:06:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:06:35,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:06:35,278 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 20 states. [2018-11-23 12:06:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,548 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 12:06:35,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:06:35,548 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-23 12:06:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:06:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 12:06:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:06:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 12:06:35,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 49 transitions. [2018-11-23 12:06:35,916 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 12:06:35,917 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:06:35,918 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:06:35,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:06:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:06:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:06:35,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:35,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:06:35,947 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:06:35,948 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:06:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,949 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:06:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:06:35,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,949 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:06:35,949 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:06:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:35,950 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:06:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:06:35,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:35,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:35,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:35,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:06:35,951 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-11-23 12:06:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:35,951 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:06:35,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:06:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:06:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:06:35,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:35,952 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:35,952 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:35,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash -665340110, now seen corresponding path program 18 times [2018-11-23 12:06:35,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:36,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {4318#true} call ULTIMATE.init(); {4318#true} is VALID [2018-11-23 12:06:36,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {4318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4318#true} is VALID [2018-11-23 12:06:36,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {4318#true} assume true; {4318#true} is VALID [2018-11-23 12:06:36,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4318#true} {4318#true} #48#return; {4318#true} is VALID [2018-11-23 12:06:36,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {4318#true} call #t~ret4 := main(); {4318#true} is VALID [2018-11-23 12:06:36,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {4318#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4320#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:36,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {4320#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4321#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:36,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {4321#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4322#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:36,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {4322#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4323#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:36,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {4323#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4324#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:36,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {4324#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4325#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:36,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {4325#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4326#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:36,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {4326#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4327#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:36,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {4327#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4328#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:36,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {4328#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4329#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:36,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {4329#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4330#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:36,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {4330#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4331#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:36,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {4331#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4332#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:36,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {4332#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4333#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:36,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {4333#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4334#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:36,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {4334#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4335#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:36,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {4335#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4336#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:36,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {4336#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4337#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:36,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {4337#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4338#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:36,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {4338#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4319#false} is VALID [2018-11-23 12:06:36,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {4319#false} havoc ~x~0;~x~0 := 1; {4319#false} is VALID [2018-11-23 12:06:36,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {4319#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4319#false} is VALID [2018-11-23 12:06:36,367 INFO L256 TraceCheckUtils]: 27: Hoare triple {4319#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4319#false} is VALID [2018-11-23 12:06:36,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {4319#false} ~cond := #in~cond; {4319#false} is VALID [2018-11-23 12:06:36,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {4319#false} assume 0 == ~cond; {4319#false} is VALID [2018-11-23 12:06:36,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {4319#false} assume !false; {4319#false} is VALID [2018-11-23 12:06:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:36,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:36,765 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:06:36,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:36,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:37,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {4318#true} call ULTIMATE.init(); {4318#true} is VALID [2018-11-23 12:06:37,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {4318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4318#true} is VALID [2018-11-23 12:06:37,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {4318#true} assume true; {4318#true} is VALID [2018-11-23 12:06:37,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4318#true} {4318#true} #48#return; {4318#true} is VALID [2018-11-23 12:06:37,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {4318#true} call #t~ret4 := main(); {4318#true} is VALID [2018-11-23 12:06:37,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {4318#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4320#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:37,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {4320#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4321#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:37,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {4321#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4322#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:37,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {4322#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4323#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:37,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {4323#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4324#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:37,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {4324#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4325#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:37,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {4325#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4326#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:37,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {4326#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4327#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:37,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {4327#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4328#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:37,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {4328#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4329#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:37,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {4329#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4330#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:37,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {4330#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4331#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:37,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {4331#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4332#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:37,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {4332#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4333#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:37,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {4333#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4334#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:37,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {4334#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4335#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:37,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {4335#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4336#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:37,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {4336#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4337#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:37,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {4337#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4338#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:37,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {4338#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4319#false} is VALID [2018-11-23 12:06:37,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {4319#false} havoc ~x~0;~x~0 := 1; {4319#false} is VALID [2018-11-23 12:06:37,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {4319#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4319#false} is VALID [2018-11-23 12:06:37,040 INFO L256 TraceCheckUtils]: 27: Hoare triple {4319#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4319#false} is VALID [2018-11-23 12:06:37,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {4319#false} ~cond := #in~cond; {4319#false} is VALID [2018-11-23 12:06:37,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {4319#false} assume 0 == ~cond; {4319#false} is VALID [2018-11-23 12:06:37,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {4319#false} assume !false; {4319#false} is VALID [2018-11-23 12:06:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:37,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:37,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 12:06:37,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2018-11-23 12:06:37,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:37,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:06:37,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:37,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:06:37,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:06:37,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:06:37,091 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 21 states. [2018-11-23 12:06:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,508 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:06:37,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:06:37,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2018-11-23 12:06:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 12:06:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:06:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 12:06:37,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 50 transitions. [2018-11-23 12:06:37,901 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 12:06:37,903 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:06:37,903 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:06:37,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:06:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:06:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:06:37,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:37,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:37,923 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:37,923 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,924 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:06:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:06:37,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:37,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:37,925 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:37,925 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:06:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,926 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:06:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:06:37,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:37,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:37,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:37,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:06:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 12:06:37,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-23 12:06:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:37,928 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 12:06:37,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:06:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:06:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:06:37,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:37,929 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:37,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1241785618, now seen corresponding path program 19 times [2018-11-23 12:06:37,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:37,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:37,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:38,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {4647#true} call ULTIMATE.init(); {4647#true} is VALID [2018-11-23 12:06:38,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {4647#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4647#true} is VALID [2018-11-23 12:06:38,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {4647#true} assume true; {4647#true} is VALID [2018-11-23 12:06:38,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4647#true} {4647#true} #48#return; {4647#true} is VALID [2018-11-23 12:06:38,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {4647#true} call #t~ret4 := main(); {4647#true} is VALID [2018-11-23 12:06:38,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {4647#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4649#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {4649#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4650#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {4650#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4651#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {4651#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4652#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {4652#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4653#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {4653#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4654#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {4654#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4655#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {4655#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4656#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {4656#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4657#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {4657#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4658#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {4658#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4659#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {4659#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4660#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4661#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {4661#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4662#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {4662#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4663#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {4663#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4664#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {4664#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4665#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {4665#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4666#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {4666#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4667#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {4667#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4668#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {4668#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4648#false} is VALID [2018-11-23 12:06:38,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {4648#false} havoc ~x~0;~x~0 := 1; {4648#false} is VALID [2018-11-23 12:06:38,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {4648#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4648#false} is VALID [2018-11-23 12:06:38,997 INFO L256 TraceCheckUtils]: 28: Hoare triple {4648#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4648#false} is VALID [2018-11-23 12:06:38,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {4648#false} ~cond := #in~cond; {4648#false} is VALID [2018-11-23 12:06:38,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {4648#false} assume 0 == ~cond; {4648#false} is VALID [2018-11-23 12:06:38,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {4648#false} assume !false; {4648#false} is VALID [2018-11-23 12:06:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:39,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:39,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:39,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:39,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {4647#true} call ULTIMATE.init(); {4647#true} is VALID [2018-11-23 12:06:39,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {4647#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4647#true} is VALID [2018-11-23 12:06:39,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {4647#true} assume true; {4647#true} is VALID [2018-11-23 12:06:39,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4647#true} {4647#true} #48#return; {4647#true} is VALID [2018-11-23 12:06:39,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {4647#true} call #t~ret4 := main(); {4647#true} is VALID [2018-11-23 12:06:39,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {4647#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4649#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:39,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {4649#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4650#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:39,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {4650#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4651#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:39,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {4651#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4652#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:39,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {4652#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4653#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:39,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {4653#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4654#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:39,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {4654#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4655#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:39,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {4655#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4656#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:39,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {4656#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4657#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:39,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {4657#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4658#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:39,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {4658#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4659#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:39,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {4659#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4660#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:39,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4661#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:39,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {4661#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4662#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:39,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {4662#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4663#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:39,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {4663#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4664#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:39,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {4664#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4665#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:39,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {4665#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4666#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:39,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {4666#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4667#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:39,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {4667#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4668#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:39,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {4668#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4648#false} is VALID [2018-11-23 12:06:39,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {4648#false} havoc ~x~0;~x~0 := 1; {4648#false} is VALID [2018-11-23 12:06:39,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {4648#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4648#false} is VALID [2018-11-23 12:06:39,255 INFO L256 TraceCheckUtils]: 28: Hoare triple {4648#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4648#false} is VALID [2018-11-23 12:06:39,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {4648#false} ~cond := #in~cond; {4648#false} is VALID [2018-11-23 12:06:39,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {4648#false} assume 0 == ~cond; {4648#false} is VALID [2018-11-23 12:06:39,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {4648#false} assume !false; {4648#false} is VALID [2018-11-23 12:06:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:39,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:39,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 12:06:39,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-11-23 12:06:39,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:39,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:06:39,303 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 12:06:39,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:06:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:06:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:06:39,304 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 22 states. [2018-11-23 12:06:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,681 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 12:06:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:06:39,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-11-23 12:06:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 12:06:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 12:06:39,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 51 transitions. [2018-11-23 12:06:39,730 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 12:06:39,731 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:06:39,731 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:06:39,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:06:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:06:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:06:39,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:39,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:39,753 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:39,754 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,755 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:06:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:06:39,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,756 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:39,756 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:06:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:39,757 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:06:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:06:39,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:39,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:39,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:39,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:06:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 12:06:39,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-11-23 12:06:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:39,759 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 12:06:39,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:06:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:06:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:06:39,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:39,760 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:39,760 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:39,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1931727182, now seen corresponding path program 20 times [2018-11-23 12:06:39,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:39,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:40,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {4986#true} call ULTIMATE.init(); {4986#true} is VALID [2018-11-23 12:06:40,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {4986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4986#true} is VALID [2018-11-23 12:06:40,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2018-11-23 12:06:40,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #48#return; {4986#true} is VALID [2018-11-23 12:06:40,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {4986#true} call #t~ret4 := main(); {4986#true} is VALID [2018-11-23 12:06:40,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {4986#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4988#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:40,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {4988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4989#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:40,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {4989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4990#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:40,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {4990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4991#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:40,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {4991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4992#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:40,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {4992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4993#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:40,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {4993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4994#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:40,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {4994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4995#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:40,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {4995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4996#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:40,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {4996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4997#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:40,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {4997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4998#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:40,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4999#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:40,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {4999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5000#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:40,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {5000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5001#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:40,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {5001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5002#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:40,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {5002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5003#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:40,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {5003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5004#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:40,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {5004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5005#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:40,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {5005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5006#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:40,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {5006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5007#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:40,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {5007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5008#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:40,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {5008#(<= main_~i~0 21)} assume !(~i~0 < 100000); {4987#false} is VALID [2018-11-23 12:06:40,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {4987#false} havoc ~x~0;~x~0 := 1; {4987#false} is VALID [2018-11-23 12:06:40,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {4987#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4987#false} is VALID [2018-11-23 12:06:40,582 INFO L256 TraceCheckUtils]: 29: Hoare triple {4987#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4987#false} is VALID [2018-11-23 12:06:40,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {4987#false} ~cond := #in~cond; {4987#false} is VALID [2018-11-23 12:06:40,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {4987#false} assume 0 == ~cond; {4987#false} is VALID [2018-11-23 12:06:40,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2018-11-23 12:06:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:40,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:40,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:40,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:40,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:40,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:40,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:40,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {4986#true} call ULTIMATE.init(); {4986#true} is VALID [2018-11-23 12:06:40,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {4986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4986#true} is VALID [2018-11-23 12:06:40,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2018-11-23 12:06:40,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #48#return; {4986#true} is VALID [2018-11-23 12:06:40,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {4986#true} call #t~ret4 := main(); {4986#true} is VALID [2018-11-23 12:06:40,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {4986#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {4988#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:40,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {4988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4989#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:40,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {4989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4990#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:40,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {4990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4991#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:40,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {4991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4992#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:40,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {4992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4993#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:40,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {4993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4994#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:40,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {4994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4995#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:40,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {4995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4996#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:40,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {4996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4997#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:40,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {4997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4998#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:40,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {4999#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:40,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {4999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5000#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:40,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {5000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5001#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:40,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {5001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5002#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:40,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {5002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5003#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:40,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {5003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5004#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:40,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {5004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5005#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:40,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {5005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5006#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:40,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {5006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5007#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:40,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {5007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5008#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:40,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {5008#(<= main_~i~0 21)} assume !(~i~0 < 100000); {4987#false} is VALID [2018-11-23 12:06:40,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {4987#false} havoc ~x~0;~x~0 := 1; {4987#false} is VALID [2018-11-23 12:06:40,853 INFO L273 TraceCheckUtils]: 28: Hoare triple {4987#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {4987#false} is VALID [2018-11-23 12:06:40,853 INFO L256 TraceCheckUtils]: 29: Hoare triple {4987#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {4987#false} is VALID [2018-11-23 12:06:40,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {4987#false} ~cond := #in~cond; {4987#false} is VALID [2018-11-23 12:06:40,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {4987#false} assume 0 == ~cond; {4987#false} is VALID [2018-11-23 12:06:40,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2018-11-23 12:06:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:40,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:40,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 12:06:40,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 12:06:40,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:40,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:06:40,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:40,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:06:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:06:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:06:40,905 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 23 states. [2018-11-23 12:06:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:41,610 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:06:41,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:06:41,611 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 12:06:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 12:06:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 12:06:41,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 52 transitions. [2018-11-23 12:06:41,667 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 12:06:41,668 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:06:41,668 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:06:41,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:06:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:06:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:06:41,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:41,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:06:41,725 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:06:41,725 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:06:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:41,727 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:06:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:06:41,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:41,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:41,728 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:06:41,728 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:06:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:41,729 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:06:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:06:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:41,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:41,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:06:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:06:41,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2018-11-23 12:06:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:41,731 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:06:41,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:06:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:06:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:06:41,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:41,732 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:41,732 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:41,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1845079186, now seen corresponding path program 21 times [2018-11-23 12:06:41,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:41,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:42,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {5335#true} call ULTIMATE.init(); {5335#true} is VALID [2018-11-23 12:06:42,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {5335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5335#true} is VALID [2018-11-23 12:06:42,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {5335#true} assume true; {5335#true} is VALID [2018-11-23 12:06:42,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5335#true} {5335#true} #48#return; {5335#true} is VALID [2018-11-23 12:06:42,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {5335#true} call #t~ret4 := main(); {5335#true} is VALID [2018-11-23 12:06:42,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {5335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {5337#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:42,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {5337#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5338#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:42,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {5338#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5339#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:42,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {5339#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5340#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:42,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {5340#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5341#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:42,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {5341#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5342#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:42,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {5342#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5343#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:42,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {5343#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5344#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:42,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {5344#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5345#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:42,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {5345#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5346#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:42,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {5346#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5347#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:42,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {5347#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5348#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:42,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {5348#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5349#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:42,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {5349#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5350#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:42,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {5350#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5351#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:42,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {5351#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5352#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:42,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {5352#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5353#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:42,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {5353#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5354#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:42,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {5354#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5355#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:42,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {5355#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5356#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:42,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {5356#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5357#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:42,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {5357#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5358#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:42,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {5358#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5336#false} is VALID [2018-11-23 12:06:42,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {5336#false} havoc ~x~0;~x~0 := 1; {5336#false} is VALID [2018-11-23 12:06:42,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {5336#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {5336#false} is VALID [2018-11-23 12:06:42,160 INFO L256 TraceCheckUtils]: 30: Hoare triple {5336#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {5336#false} is VALID [2018-11-23 12:06:42,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {5336#false} ~cond := #in~cond; {5336#false} is VALID [2018-11-23 12:06:42,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {5336#false} assume 0 == ~cond; {5336#false} is VALID [2018-11-23 12:06:42,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {5336#false} assume !false; {5336#false} is VALID [2018-11-23 12:06:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:42,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:42,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:43,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:06:43,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:43,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:43,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {5335#true} call ULTIMATE.init(); {5335#true} is VALID [2018-11-23 12:06:43,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {5335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5335#true} is VALID [2018-11-23 12:06:43,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {5335#true} assume true; {5335#true} is VALID [2018-11-23 12:06:43,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5335#true} {5335#true} #48#return; {5335#true} is VALID [2018-11-23 12:06:43,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {5335#true} call #t~ret4 := main(); {5335#true} is VALID [2018-11-23 12:06:43,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {5335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {5337#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:43,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {5337#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5338#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:43,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {5338#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5339#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:43,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {5339#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5340#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:43,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {5340#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5341#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:43,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {5341#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5342#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:43,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {5342#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5343#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:43,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {5343#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5344#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:43,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {5344#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5345#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:43,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {5345#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5346#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:43,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {5346#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5347#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:43,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {5347#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5348#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:43,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {5348#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5349#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:43,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {5349#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5350#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:43,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {5350#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5351#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:43,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {5351#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5352#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:43,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {5352#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5353#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:43,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {5353#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5354#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:43,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {5354#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5355#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:43,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {5355#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5356#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:43,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {5356#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5357#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:43,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {5357#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5358#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:43,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {5358#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5336#false} is VALID [2018-11-23 12:06:43,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {5336#false} havoc ~x~0;~x~0 := 1; {5336#false} is VALID [2018-11-23 12:06:43,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {5336#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {5336#false} is VALID [2018-11-23 12:06:43,201 INFO L256 TraceCheckUtils]: 30: Hoare triple {5336#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {5336#false} is VALID [2018-11-23 12:06:43,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {5336#false} ~cond := #in~cond; {5336#false} is VALID [2018-11-23 12:06:43,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {5336#false} assume 0 == ~cond; {5336#false} is VALID [2018-11-23 12:06:43,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {5336#false} assume !false; {5336#false} is VALID [2018-11-23 12:06:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:43,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:43,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 12:06:43,223 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-11-23 12:06:43,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:43,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:06:43,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:43,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:06:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:06:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:06:43,251 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 24 states. [2018-11-23 12:06:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,503 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:06:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:06:43,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-11-23 12:06:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:06:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:06:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:06:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:06:43,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 53 transitions. [2018-11-23 12:06:43,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:43,552 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:06:43,552 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:06:43,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:06:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:06:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:06:43,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:43,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:06:43,755 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:06:43,755 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:06:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,756 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:06:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:06:43,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:43,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:43,757 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:06:43,757 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:06:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:43,758 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:06:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:06:43,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:43,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:43,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:43,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:06:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 12:06:43,760 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2018-11-23 12:06:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:43,760 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 12:06:43,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:06:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:06:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:06:43,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:43,761 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:43,761 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:43,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 22 times [2018-11-23 12:06:43,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:43,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:43,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:43,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {5694#true} call ULTIMATE.init(); {5694#true} is VALID [2018-11-23 12:06:44,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {5694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5694#true} is VALID [2018-11-23 12:06:44,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {5694#true} assume true; {5694#true} is VALID [2018-11-23 12:06:44,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5694#true} {5694#true} #48#return; {5694#true} is VALID [2018-11-23 12:06:44,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {5694#true} call #t~ret4 := main(); {5694#true} is VALID [2018-11-23 12:06:44,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {5694#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {5696#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:44,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {5696#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5697#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:44,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {5697#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5698#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:44,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5699#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:44,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {5699#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5700#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:44,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {5700#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5701#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:44,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {5701#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5702#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:44,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {5702#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5703#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:44,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {5703#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5704#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:44,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {5704#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5705#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:44,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {5705#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5706#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:44,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {5706#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5707#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:44,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5708#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:44,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {5708#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5709#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:44,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {5709#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5710#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:44,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {5710#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5711#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:44,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {5711#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5712#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:44,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {5712#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5713#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:44,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {5713#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5714#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:44,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {5714#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5715#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:44,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {5715#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5716#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:44,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {5716#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5717#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:44,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {5717#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5718#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:44,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {5718#(<= main_~i~0 23)} assume !(~i~0 < 100000); {5695#false} is VALID [2018-11-23 12:06:44,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {5695#false} havoc ~x~0;~x~0 := 1; {5695#false} is VALID [2018-11-23 12:06:44,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {5695#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {5695#false} is VALID [2018-11-23 12:06:44,918 INFO L256 TraceCheckUtils]: 31: Hoare triple {5695#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {5695#false} is VALID [2018-11-23 12:06:44,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {5695#false} ~cond := #in~cond; {5695#false} is VALID [2018-11-23 12:06:44,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {5695#false} assume 0 == ~cond; {5695#false} is VALID [2018-11-23 12:06:44,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {5695#false} assume !false; {5695#false} is VALID [2018-11-23 12:06:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:44,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:44,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:44,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:44,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:45,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {5694#true} call ULTIMATE.init(); {5694#true} is VALID [2018-11-23 12:06:45,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {5694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5694#true} is VALID [2018-11-23 12:06:45,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {5694#true} assume true; {5694#true} is VALID [2018-11-23 12:06:45,143 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5694#true} {5694#true} #48#return; {5694#true} is VALID [2018-11-23 12:06:45,143 INFO L256 TraceCheckUtils]: 4: Hoare triple {5694#true} call #t~ret4 := main(); {5694#true} is VALID [2018-11-23 12:06:45,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {5694#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {5696#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:45,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {5696#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5697#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:45,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {5697#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5698#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:45,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5699#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:45,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {5699#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5700#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:45,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {5700#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5701#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:45,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {5701#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5702#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:45,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {5702#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5703#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:45,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {5703#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5704#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:45,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {5704#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5705#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:45,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {5705#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5706#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:45,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {5706#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5707#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:45,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5708#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:45,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {5708#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5709#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:45,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {5709#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5710#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:45,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {5710#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5711#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:45,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {5711#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5712#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:45,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {5712#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5713#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:45,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {5713#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5714#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:45,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {5714#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5715#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:45,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {5715#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5716#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:45,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {5716#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5717#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:45,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {5717#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {5718#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:45,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {5718#(<= main_~i~0 23)} assume !(~i~0 < 100000); {5695#false} is VALID [2018-11-23 12:06:45,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {5695#false} havoc ~x~0;~x~0 := 1; {5695#false} is VALID [2018-11-23 12:06:45,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {5695#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {5695#false} is VALID [2018-11-23 12:06:45,168 INFO L256 TraceCheckUtils]: 31: Hoare triple {5695#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {5695#false} is VALID [2018-11-23 12:06:45,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {5695#false} ~cond := #in~cond; {5695#false} is VALID [2018-11-23 12:06:45,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {5695#false} assume 0 == ~cond; {5695#false} is VALID [2018-11-23 12:06:45,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {5695#false} assume !false; {5695#false} is VALID [2018-11-23 12:06:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 12:06:45,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-11-23 12:06:45,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:45,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:06:45,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:45,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:06:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:06:45,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:06:45,217 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 25 states. [2018-11-23 12:06:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:45,587 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:06:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:06:45,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-11-23 12:06:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:06:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 12:06:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:06:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 12:06:45,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2018-11-23 12:06:45,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:45,639 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:06:45,639 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:06:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:06:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:06:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:06:45,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:45,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 12:06:45,667 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:06:45,667 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:06:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:45,668 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:06:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:06:45,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:45,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:45,670 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:06:45,670 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:06:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:45,671 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:06:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:06:45,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:45,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:45,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:45,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:06:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 12:06:45,673 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-11-23 12:06:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:45,673 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 12:06:45,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:06:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:06:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:06:45,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:45,674 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:45,674 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:45,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1789613074, now seen corresponding path program 23 times [2018-11-23 12:06:45,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:45,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:45,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:46,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {6063#true} call ULTIMATE.init(); {6063#true} is VALID [2018-11-23 12:06:46,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {6063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6063#true} is VALID [2018-11-23 12:06:46,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {6063#true} assume true; {6063#true} is VALID [2018-11-23 12:06:46,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6063#true} {6063#true} #48#return; {6063#true} is VALID [2018-11-23 12:06:46,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {6063#true} call #t~ret4 := main(); {6063#true} is VALID [2018-11-23 12:06:46,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {6063#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6065#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:46,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {6065#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6066#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:46,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {6066#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6067#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:46,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {6067#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6068#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:46,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {6068#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6069#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:46,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {6069#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6070#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:46,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {6070#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6071#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:46,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {6071#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6072#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:46,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {6072#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6073#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:46,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {6073#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6074#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:46,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {6074#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6075#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:46,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {6075#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6076#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:46,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {6076#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6077#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:46,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {6077#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6078#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:46,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6079#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:46,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {6079#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6080#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:46,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {6080#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6081#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:46,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {6081#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6082#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:46,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {6082#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6083#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:46,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {6083#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6084#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:46,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {6084#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6085#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:46,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {6085#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6086#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:46,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {6086#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6087#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:46,461 INFO L273 TraceCheckUtils]: 28: Hoare triple {6087#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6088#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:46,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {6088#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6064#false} is VALID [2018-11-23 12:06:46,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {6064#false} havoc ~x~0;~x~0 := 1; {6064#false} is VALID [2018-11-23 12:06:46,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {6064#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6064#false} is VALID [2018-11-23 12:06:46,462 INFO L256 TraceCheckUtils]: 32: Hoare triple {6064#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6064#false} is VALID [2018-11-23 12:06:46,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {6064#false} ~cond := #in~cond; {6064#false} is VALID [2018-11-23 12:06:46,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {6064#false} assume 0 == ~cond; {6064#false} is VALID [2018-11-23 12:06:46,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {6064#false} assume !false; {6064#false} is VALID [2018-11-23 12:06:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:46,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:46,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:47,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:06:47,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:47,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:47,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {6063#true} call ULTIMATE.init(); {6063#true} is VALID [2018-11-23 12:06:47,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {6063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6063#true} is VALID [2018-11-23 12:06:47,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {6063#true} assume true; {6063#true} is VALID [2018-11-23 12:06:47,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6063#true} {6063#true} #48#return; {6063#true} is VALID [2018-11-23 12:06:47,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {6063#true} call #t~ret4 := main(); {6063#true} is VALID [2018-11-23 12:06:47,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {6063#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6065#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:47,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {6065#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6066#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:47,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {6066#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6067#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:47,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {6067#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6068#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:47,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {6068#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6069#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:47,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {6069#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6070#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:47,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {6070#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6071#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:47,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {6071#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6072#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:47,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {6072#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6073#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:47,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {6073#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6074#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:47,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {6074#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6075#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:47,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {6075#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6076#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:47,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {6076#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6077#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:47,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {6077#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6078#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:47,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6079#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:47,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {6079#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6080#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:47,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {6080#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6081#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:47,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {6081#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6082#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:47,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {6082#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6083#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:47,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {6083#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6084#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:47,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {6084#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6085#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:47,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {6085#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6086#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:47,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {6086#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6087#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:47,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {6087#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6088#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:47,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {6088#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6064#false} is VALID [2018-11-23 12:06:47,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {6064#false} havoc ~x~0;~x~0 := 1; {6064#false} is VALID [2018-11-23 12:06:47,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {6064#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6064#false} is VALID [2018-11-23 12:06:47,392 INFO L256 TraceCheckUtils]: 32: Hoare triple {6064#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6064#false} is VALID [2018-11-23 12:06:47,392 INFO L273 TraceCheckUtils]: 33: Hoare triple {6064#false} ~cond := #in~cond; {6064#false} is VALID [2018-11-23 12:06:47,392 INFO L273 TraceCheckUtils]: 34: Hoare triple {6064#false} assume 0 == ~cond; {6064#false} is VALID [2018-11-23 12:06:47,393 INFO L273 TraceCheckUtils]: 35: Hoare triple {6064#false} assume !false; {6064#false} is VALID [2018-11-23 12:06:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:47,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:47,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 12:06:47,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-23 12:06:47,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:47,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:06:47,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:47,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:06:47,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:06:47,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:06:47,445 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 26 states. [2018-11-23 12:06:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,102 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 12:06:48,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:06:48,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-23 12:06:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:06:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 12:06:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:06:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 12:06:48,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 55 transitions. [2018-11-23 12:06:48,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:48,148 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:06:48,148 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:06:48,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:06:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:06:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:06:48,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:48,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:48,167 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:48,167 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,168 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:06:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:06:48,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,168 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:48,169 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:06:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:48,170 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:06:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:06:48,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:48,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:48,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:48,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:06:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:06:48,171 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2018-11-23 12:06:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:06:48,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:06:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:06:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:06:48,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:48,173 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:48,173 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:48,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1734509134, now seen corresponding path program 24 times [2018-11-23 12:06:48,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:48,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:49,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {6442#true} call ULTIMATE.init(); {6442#true} is VALID [2018-11-23 12:06:49,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {6442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6442#true} is VALID [2018-11-23 12:06:49,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {6442#true} assume true; {6442#true} is VALID [2018-11-23 12:06:49,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6442#true} {6442#true} #48#return; {6442#true} is VALID [2018-11-23 12:06:49,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {6442#true} call #t~ret4 := main(); {6442#true} is VALID [2018-11-23 12:06:49,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {6442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:49,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {6444#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:49,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {6445#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:49,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {6446#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:49,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {6447#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:49,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {6448#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:49,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {6449#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:49,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {6450#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:49,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {6451#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:49,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {6452#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:49,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {6453#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:49,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {6454#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:49,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {6455#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:49,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {6456#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:49,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {6457#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:49,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {6458#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:49,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {6459#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:49,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {6460#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:49,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {6461#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:49,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {6462#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:49,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {6463#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:49,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {6464#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:49,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {6465#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:49,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {6466#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:49,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {6467#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:49,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {6468#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6443#false} is VALID [2018-11-23 12:06:49,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {6443#false} havoc ~x~0;~x~0 := 1; {6443#false} is VALID [2018-11-23 12:06:49,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {6443#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6443#false} is VALID [2018-11-23 12:06:49,352 INFO L256 TraceCheckUtils]: 33: Hoare triple {6443#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6443#false} is VALID [2018-11-23 12:06:49,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {6443#false} ~cond := #in~cond; {6443#false} is VALID [2018-11-23 12:06:49,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {6443#false} assume 0 == ~cond; {6443#false} is VALID [2018-11-23 12:06:49,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {6443#false} assume !false; {6443#false} is VALID [2018-11-23 12:06:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:49,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:49,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:50,522 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:06:50,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:50,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:50,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {6442#true} call ULTIMATE.init(); {6442#true} is VALID [2018-11-23 12:06:50,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {6442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6442#true} is VALID [2018-11-23 12:06:50,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {6442#true} assume true; {6442#true} is VALID [2018-11-23 12:06:50,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6442#true} {6442#true} #48#return; {6442#true} is VALID [2018-11-23 12:06:50,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {6442#true} call #t~ret4 := main(); {6442#true} is VALID [2018-11-23 12:06:50,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {6442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:50,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {6444#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:50,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {6445#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:50,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {6446#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:50,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {6447#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:50,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {6448#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:50,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {6449#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:50,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {6450#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:50,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {6451#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:50,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {6452#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:50,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {6453#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:50,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {6454#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:50,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {6455#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:50,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {6456#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:50,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {6457#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:50,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {6458#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:50,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {6459#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:50,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {6460#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:50,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {6461#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:50,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {6462#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:50,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {6463#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:50,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {6464#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:50,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {6465#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:50,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {6466#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:50,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {6467#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:50,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {6468#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6443#false} is VALID [2018-11-23 12:06:50,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {6443#false} havoc ~x~0;~x~0 := 1; {6443#false} is VALID [2018-11-23 12:06:50,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {6443#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6443#false} is VALID [2018-11-23 12:06:50,739 INFO L256 TraceCheckUtils]: 33: Hoare triple {6443#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6443#false} is VALID [2018-11-23 12:06:50,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {6443#false} ~cond := #in~cond; {6443#false} is VALID [2018-11-23 12:06:50,740 INFO L273 TraceCheckUtils]: 35: Hoare triple {6443#false} assume 0 == ~cond; {6443#false} is VALID [2018-11-23 12:06:50,740 INFO L273 TraceCheckUtils]: 36: Hoare triple {6443#false} assume !false; {6443#false} is VALID [2018-11-23 12:06:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:50,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:50,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 12:06:50,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-11-23 12:06:50,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:50,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:06:50,792 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 12:06:50,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:06:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:06:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:06:50,794 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 27 states. [2018-11-23 12:06:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:50,968 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:06:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:06:50,968 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-11-23 12:06:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 12:06:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 12:06:50,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 56 transitions. [2018-11-23 12:06:51,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:51,023 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:06:51,023 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:06:51,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:06:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:06:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:06:51,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:51,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:51,100 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:51,100 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,101 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:06:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:06:51,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:51,102 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:51,102 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:06:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:51,102 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:06:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:06:51,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:51,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:51,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:51,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:06:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 12:06:51,104 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 37 [2018-11-23 12:06:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:51,104 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 12:06:51,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:06:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:06:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:06:51,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:51,105 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:51,105 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:51,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash -26286994, now seen corresponding path program 25 times [2018-11-23 12:06:51,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:51,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:51,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:52,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {6831#true} call ULTIMATE.init(); {6831#true} is VALID [2018-11-23 12:06:52,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {6831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6831#true} is VALID [2018-11-23 12:06:52,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {6831#true} assume true; {6831#true} is VALID [2018-11-23 12:06:52,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6831#true} {6831#true} #48#return; {6831#true} is VALID [2018-11-23 12:06:52,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {6831#true} call #t~ret4 := main(); {6831#true} is VALID [2018-11-23 12:06:52,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {6831#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6833#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {6833#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6834#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {6834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {6835#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6836#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {6836#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6837#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {6837#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6838#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {6838#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6839#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {6839#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6840#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {6840#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6841#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {6841#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6842#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {6842#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6843#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {6843#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6844#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {6844#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6845#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {6845#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6846#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {6846#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6847#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {6847#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6848#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {6848#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6849#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {6849#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6850#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {6850#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6851#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6852#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {6852#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6853#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {6853#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6854#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {6854#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6855#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {6855#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6856#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {6856#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6857#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {6857#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {6858#(<= main_~i~0 26)} assume !(~i~0 < 100000); {6832#false} is VALID [2018-11-23 12:06:52,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {6832#false} havoc ~x~0;~x~0 := 1; {6832#false} is VALID [2018-11-23 12:06:52,453 INFO L273 TraceCheckUtils]: 33: Hoare triple {6832#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6832#false} is VALID [2018-11-23 12:06:52,453 INFO L256 TraceCheckUtils]: 34: Hoare triple {6832#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6832#false} is VALID [2018-11-23 12:06:52,453 INFO L273 TraceCheckUtils]: 35: Hoare triple {6832#false} ~cond := #in~cond; {6832#false} is VALID [2018-11-23 12:06:52,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {6832#false} assume 0 == ~cond; {6832#false} is VALID [2018-11-23 12:06:52,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {6832#false} assume !false; {6832#false} is VALID [2018-11-23 12:06:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:52,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:52,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:52,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:52,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:52,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {6831#true} call ULTIMATE.init(); {6831#true} is VALID [2018-11-23 12:06:52,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {6831#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6831#true} is VALID [2018-11-23 12:06:52,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {6831#true} assume true; {6831#true} is VALID [2018-11-23 12:06:52,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6831#true} {6831#true} #48#return; {6831#true} is VALID [2018-11-23 12:06:52,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {6831#true} call #t~ret4 := main(); {6831#true} is VALID [2018-11-23 12:06:52,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {6831#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {6833#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {6833#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6834#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {6834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {6835#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6836#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {6836#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6837#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {6837#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6838#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {6838#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6839#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {6839#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6840#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {6840#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6841#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {6841#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6842#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {6842#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6843#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {6843#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6844#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {6844#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6845#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {6845#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6846#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {6846#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6847#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {6847#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6848#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {6848#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6849#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {6849#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6850#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {6850#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6851#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6852#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {6852#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6853#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {6853#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6854#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {6854#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6855#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {6855#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6856#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {6856#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6857#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {6857#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {6858#(<= main_~i~0 26)} assume !(~i~0 < 100000); {6832#false} is VALID [2018-11-23 12:06:52,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {6832#false} havoc ~x~0;~x~0 := 1; {6832#false} is VALID [2018-11-23 12:06:52,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {6832#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {6832#false} is VALID [2018-11-23 12:06:52,682 INFO L256 TraceCheckUtils]: 34: Hoare triple {6832#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {6832#false} is VALID [2018-11-23 12:06:52,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {6832#false} ~cond := #in~cond; {6832#false} is VALID [2018-11-23 12:06:52,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {6832#false} assume 0 == ~cond; {6832#false} is VALID [2018-11-23 12:06:52,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {6832#false} assume !false; {6832#false} is VALID [2018-11-23 12:06:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:52,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:52,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 12:06:52,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-11-23 12:06:52,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:52,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:06:52,737 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 12:06:52,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:06:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:06:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:52,738 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 28 states. [2018-11-23 12:06:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,023 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 12:06:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:06:53,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-11-23 12:06:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 12:06:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 12:06:53,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 57 transitions. [2018-11-23 12:06:53,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:53,174 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:06:53,174 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:06:53,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:06:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:06:53,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:53,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:53,201 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:53,202 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,203 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:06:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:06:53,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:53,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:53,204 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:53,204 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:06:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,205 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:06:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:06:53,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:53,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:53,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:53,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:06:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 12:06:53,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 38 [2018-11-23 12:06:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:53,206 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 12:06:53,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:06:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:06:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:06:53,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:53,207 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:53,207 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:53,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1388991794, now seen corresponding path program 26 times [2018-11-23 12:06:53,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:53,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:54,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {7230#true} call ULTIMATE.init(); {7230#true} is VALID [2018-11-23 12:06:54,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {7230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7230#true} is VALID [2018-11-23 12:06:54,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {7230#true} assume true; {7230#true} is VALID [2018-11-23 12:06:54,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7230#true} {7230#true} #48#return; {7230#true} is VALID [2018-11-23 12:06:54,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {7230#true} call #t~ret4 := main(); {7230#true} is VALID [2018-11-23 12:06:54,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {7230#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {7232#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7233#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7234#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7235#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7236#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7237#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7238#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7239#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7240#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7241#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7242#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7243#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7244#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7245#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7246#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7247#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7248#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7249#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7250#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7251#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7252#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {7252#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7253#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {7253#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7254#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {7254#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7255#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {7255#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7256#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {7256#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7257#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {7257#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {7258#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7231#false} is VALID [2018-11-23 12:06:54,839 INFO L273 TraceCheckUtils]: 33: Hoare triple {7231#false} havoc ~x~0;~x~0 := 1; {7231#false} is VALID [2018-11-23 12:06:54,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {7231#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {7231#false} is VALID [2018-11-23 12:06:54,839 INFO L256 TraceCheckUtils]: 35: Hoare triple {7231#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {7231#false} is VALID [2018-11-23 12:06:54,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {7231#false} ~cond := #in~cond; {7231#false} is VALID [2018-11-23 12:06:54,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {7231#false} assume 0 == ~cond; {7231#false} is VALID [2018-11-23 12:06:54,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {7231#false} assume !false; {7231#false} is VALID [2018-11-23 12:06:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:54,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:54,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:54,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:54,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:54,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:55,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {7230#true} call ULTIMATE.init(); {7230#true} is VALID [2018-11-23 12:06:55,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {7230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7230#true} is VALID [2018-11-23 12:06:55,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {7230#true} assume true; {7230#true} is VALID [2018-11-23 12:06:55,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7230#true} {7230#true} #48#return; {7230#true} is VALID [2018-11-23 12:06:55,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {7230#true} call #t~ret4 := main(); {7230#true} is VALID [2018-11-23 12:06:55,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {7230#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {7232#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7233#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7234#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7235#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7236#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7237#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7238#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7239#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7240#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7241#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7242#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7243#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7244#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7245#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7246#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7247#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7248#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7249#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7250#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7251#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7252#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {7252#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7253#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {7253#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7254#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {7254#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7255#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {7255#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7256#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,066 INFO L273 TraceCheckUtils]: 30: Hoare triple {7256#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7257#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {7257#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {7258#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7231#false} is VALID [2018-11-23 12:06:55,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {7231#false} havoc ~x~0;~x~0 := 1; {7231#false} is VALID [2018-11-23 12:06:55,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {7231#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {7231#false} is VALID [2018-11-23 12:06:55,068 INFO L256 TraceCheckUtils]: 35: Hoare triple {7231#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {7231#false} is VALID [2018-11-23 12:06:55,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {7231#false} ~cond := #in~cond; {7231#false} is VALID [2018-11-23 12:06:55,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {7231#false} assume 0 == ~cond; {7231#false} is VALID [2018-11-23 12:06:55,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {7231#false} assume !false; {7231#false} is VALID [2018-11-23 12:06:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 12:06:55,090 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-11-23 12:06:55,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:55,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:06:55,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:55,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:06:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:06:55,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:55,120 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 29 states. [2018-11-23 12:06:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:55,540 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:06:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:06:55,541 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-11-23 12:06:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 12:06:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 12:06:55,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 58 transitions. [2018-11-23 12:06:55,714 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 12:06:55,716 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:06:55,716 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:06:55,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:06:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:06:55,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:55,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 12:06:55,753 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:06:55,753 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:06:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:55,755 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:06:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:06:55,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:55,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:55,756 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:06:55,756 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:06:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:55,757 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:06:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:06:55,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:55,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:55,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:55,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:06:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:06:55,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2018-11-23 12:06:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:55,759 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:06:55,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:06:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:06:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:06:55,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:55,760 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:55,760 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:55,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1982006034, now seen corresponding path program 27 times [2018-11-23 12:06:55,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:55,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:56,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {7639#true} call ULTIMATE.init(); {7639#true} is VALID [2018-11-23 12:06:56,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {7639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7639#true} is VALID [2018-11-23 12:06:56,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {7639#true} assume true; {7639#true} is VALID [2018-11-23 12:06:56,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7639#true} {7639#true} #48#return; {7639#true} is VALID [2018-11-23 12:06:56,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {7639#true} call #t~ret4 := main(); {7639#true} is VALID [2018-11-23 12:06:56,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {7639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {7641#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:56,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {7641#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7642#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:56,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {7642#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7643#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:56,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {7643#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7644#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:56,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {7644#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7645#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:56,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {7645#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7646#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:56,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {7646#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7647#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:56,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {7647#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7648#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:56,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {7648#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7649#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:56,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {7649#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7650#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:56,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {7650#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7651#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:56,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {7651#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7652#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:56,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {7652#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7653#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:56,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {7653#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7654#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:56,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {7654#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7655#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:56,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {7655#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7656#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:56,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {7656#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7657#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:56,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {7657#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7658#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:56,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {7658#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7659#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:56,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {7659#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7660#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:56,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {7660#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7661#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:56,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {7661#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7662#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:56,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {7662#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7663#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:56,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {7663#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7664#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:56,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {7664#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7665#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:56,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {7665#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7666#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:56,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7667#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:56,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7668#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:56,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {7668#(<= main_~i~0 28)} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:06:56,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {7640#false} havoc ~x~0;~x~0 := 1; {7640#false} is VALID [2018-11-23 12:06:56,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {7640#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {7640#false} is VALID [2018-11-23 12:06:56,416 INFO L256 TraceCheckUtils]: 36: Hoare triple {7640#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {7640#false} is VALID [2018-11-23 12:06:56,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {7640#false} ~cond := #in~cond; {7640#false} is VALID [2018-11-23 12:06:56,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {7640#false} assume 0 == ~cond; {7640#false} is VALID [2018-11-23 12:06:56,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {7640#false} assume !false; {7640#false} is VALID [2018-11-23 12:06:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:56,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:56,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:56,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:58,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 12:06:58,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:58,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:59,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {7639#true} call ULTIMATE.init(); {7639#true} is VALID [2018-11-23 12:06:59,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {7639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7639#true} is VALID [2018-11-23 12:06:59,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {7639#true} assume true; {7639#true} is VALID [2018-11-23 12:06:59,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7639#true} {7639#true} #48#return; {7639#true} is VALID [2018-11-23 12:06:59,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {7639#true} call #t~ret4 := main(); {7639#true} is VALID [2018-11-23 12:06:59,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {7639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {7641#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:59,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {7641#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7642#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:59,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {7642#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7643#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:59,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {7643#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7644#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:59,123 INFO L273 TraceCheckUtils]: 9: Hoare triple {7644#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7645#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:59,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {7645#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7646#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:59,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {7646#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7647#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:59,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {7647#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7648#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:59,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {7648#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7649#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:59,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {7649#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7650#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:59,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {7650#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7651#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:59,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {7651#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7652#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:59,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {7652#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7653#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:59,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {7653#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7654#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:59,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {7654#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7655#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:59,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {7655#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7656#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:59,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {7656#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7657#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:59,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {7657#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7658#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:59,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {7658#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7659#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:59,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {7659#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7660#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:59,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {7660#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7661#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:59,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {7661#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7662#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:59,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {7662#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7663#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:59,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {7663#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7664#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:59,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {7664#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7665#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:59,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {7665#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7666#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:59,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {7666#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7667#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:59,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {7667#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {7668#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:59,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {7668#(<= main_~i~0 28)} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:06:59,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {7640#false} havoc ~x~0;~x~0 := 1; {7640#false} is VALID [2018-11-23 12:06:59,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {7640#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {7640#false} is VALID [2018-11-23 12:06:59,146 INFO L256 TraceCheckUtils]: 36: Hoare triple {7640#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {7640#false} is VALID [2018-11-23 12:06:59,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {7640#false} ~cond := #in~cond; {7640#false} is VALID [2018-11-23 12:06:59,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {7640#false} assume 0 == ~cond; {7640#false} is VALID [2018-11-23 12:06:59,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {7640#false} assume !false; {7640#false} is VALID [2018-11-23 12:06:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:59,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:59,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 12:06:59,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 12:06:59,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:59,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:06:59,251 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 12:06:59,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:06:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:06:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:59,252 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2018-11-23 12:06:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:59,861 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 12:06:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:06:59,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 12:06:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 12:06:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 12:06:59,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 59 transitions. [2018-11-23 12:06:59,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:59,915 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:06:59,916 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:06:59,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:06:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:06:59,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:59,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:06:59,940 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:06:59,940 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:06:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:59,941 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:06:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:06:59,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:59,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:59,942 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:06:59,942 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:06:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:59,942 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:06:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:06:59,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:59,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:59,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:59,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:06:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 12:06:59,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-11-23 12:06:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:59,944 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 12:06:59,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:06:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:06:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:06:59,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:59,945 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:59,945 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:59,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash 891243698, now seen corresponding path program 28 times [2018-11-23 12:06:59,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:59,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:59,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:00,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {8058#true} call ULTIMATE.init(); {8058#true} is VALID [2018-11-23 12:07:00,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {8058#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8058#true} is VALID [2018-11-23 12:07:00,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {8058#true} assume true; {8058#true} is VALID [2018-11-23 12:07:00,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8058#true} {8058#true} #48#return; {8058#true} is VALID [2018-11-23 12:07:00,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {8058#true} call #t~ret4 := main(); {8058#true} is VALID [2018-11-23 12:07:00,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {8058#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8060#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {8060#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8061#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {8061#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8062#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {8062#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8063#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {8063#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8064#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {8064#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8065#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {8065#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8066#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {8066#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8067#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {8067#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8068#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {8068#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8069#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {8069#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8070#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {8070#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8071#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {8071#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8072#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {8072#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8073#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {8073#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8074#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {8074#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8075#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {8075#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8076#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:00,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {8076#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8077#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:00,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {8077#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8078#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:00,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {8078#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8079#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:00,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {8079#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8080#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:00,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {8080#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8081#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:00,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {8081#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8082#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:00,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {8082#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8083#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:00,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {8083#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8084#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:00,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {8084#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8085#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:00,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {8085#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8086#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:00,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {8086#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8087#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:00,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {8087#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8088#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:00,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {8088#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8059#false} is VALID [2018-11-23 12:07:00,489 INFO L273 TraceCheckUtils]: 35: Hoare triple {8059#false} havoc ~x~0;~x~0 := 1; {8059#false} is VALID [2018-11-23 12:07:00,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {8059#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8059#false} is VALID [2018-11-23 12:07:00,489 INFO L256 TraceCheckUtils]: 37: Hoare triple {8059#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8059#false} is VALID [2018-11-23 12:07:00,490 INFO L273 TraceCheckUtils]: 38: Hoare triple {8059#false} ~cond := #in~cond; {8059#false} is VALID [2018-11-23 12:07:00,490 INFO L273 TraceCheckUtils]: 39: Hoare triple {8059#false} assume 0 == ~cond; {8059#false} is VALID [2018-11-23 12:07:00,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {8059#false} assume !false; {8059#false} is VALID [2018-11-23 12:07:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:00,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:00,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:00,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:00,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:00,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:00,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:00,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {8058#true} call ULTIMATE.init(); {8058#true} is VALID [2018-11-23 12:07:00,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {8058#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8058#true} is VALID [2018-11-23 12:07:00,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {8058#true} assume true; {8058#true} is VALID [2018-11-23 12:07:00,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8058#true} {8058#true} #48#return; {8058#true} is VALID [2018-11-23 12:07:00,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {8058#true} call #t~ret4 := main(); {8058#true} is VALID [2018-11-23 12:07:00,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {8058#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8060#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:00,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {8060#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8061#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:00,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {8061#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8062#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:00,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {8062#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8063#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:00,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {8063#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8064#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:00,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {8064#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8065#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:00,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {8065#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8066#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:00,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {8066#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8067#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:00,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {8067#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8068#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:00,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {8068#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8069#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:00,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {8069#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8070#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:00,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {8070#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8071#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:00,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {8071#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8072#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:00,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {8072#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8073#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:00,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {8073#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8074#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:00,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {8074#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8075#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:00,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {8075#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8076#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:00,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {8076#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8077#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:00,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {8077#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8078#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:00,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {8078#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8079#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:00,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {8079#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8080#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:00,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {8080#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8081#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:00,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {8081#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8082#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:00,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {8082#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8083#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:00,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {8083#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8084#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:00,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {8084#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8085#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:00,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {8085#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8086#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:00,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {8086#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8087#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:00,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {8087#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8088#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:00,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {8088#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8059#false} is VALID [2018-11-23 12:07:00,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {8059#false} havoc ~x~0;~x~0 := 1; {8059#false} is VALID [2018-11-23 12:07:00,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {8059#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8059#false} is VALID [2018-11-23 12:07:00,759 INFO L256 TraceCheckUtils]: 37: Hoare triple {8059#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8059#false} is VALID [2018-11-23 12:07:00,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {8059#false} ~cond := #in~cond; {8059#false} is VALID [2018-11-23 12:07:00,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {8059#false} assume 0 == ~cond; {8059#false} is VALID [2018-11-23 12:07:00,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {8059#false} assume !false; {8059#false} is VALID [2018-11-23 12:07:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:00,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 12:07:00,781 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-11-23 12:07:00,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:00,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:07:00,815 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 12:07:00,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:07:00,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:07:00,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:07:00,817 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 31 states. [2018-11-23 12:07:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,353 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:07:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:07:01,354 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-11-23 12:07:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:07:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 12:07:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:07:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 12:07:01,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 60 transitions. [2018-11-23 12:07:01,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:01,408 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:07:01,408 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:07:01,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:07:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:07:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:07:01,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:01,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:07:01,458 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:07:01,458 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:07:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,460 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:07:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:07:01,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:01,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:01,460 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:07:01,461 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:07:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:01,461 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:07:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:07:01,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:01,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:01,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:01,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:07:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 12:07:01,463 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 41 [2018-11-23 12:07:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:01,463 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 12:07:01,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:07:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:07:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:07:01,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:01,464 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:01,464 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:01,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -232327826, now seen corresponding path program 29 times [2018-11-23 12:07:01,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:01,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:01,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {8487#true} call ULTIMATE.init(); {8487#true} is VALID [2018-11-23 12:07:01,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {8487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8487#true} is VALID [2018-11-23 12:07:01,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {8487#true} assume true; {8487#true} is VALID [2018-11-23 12:07:01,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8487#true} {8487#true} #48#return; {8487#true} is VALID [2018-11-23 12:07:01,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {8487#true} call #t~ret4 := main(); {8487#true} is VALID [2018-11-23 12:07:01,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {8487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8489#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:01,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {8489#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8490#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:01,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {8490#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8491#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:01,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {8491#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8492#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:01,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {8492#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8493#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:01,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {8493#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8494#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:01,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {8494#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8495#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:01,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {8495#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8496#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:01,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {8496#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8497#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:01,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {8497#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8498#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:01,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {8498#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8499#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:01,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {8499#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8500#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:01,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {8500#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8501#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:01,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {8501#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8502#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:01,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {8502#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8503#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:01,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {8503#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8504#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:01,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {8504#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8505#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:01,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {8505#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8506#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:02,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8507#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:02,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {8507#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:02,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {8508#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:02,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {8509#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:02,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {8510#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:02,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {8511#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:02,007 INFO L273 TraceCheckUtils]: 29: Hoare triple {8512#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:02,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {8513#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:02,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {8514#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:02,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:02,011 INFO L273 TraceCheckUtils]: 33: Hoare triple {8516#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:02,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {8517#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:02,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {8518#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8488#false} is VALID [2018-11-23 12:07:02,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {8488#false} havoc ~x~0;~x~0 := 1; {8488#false} is VALID [2018-11-23 12:07:02,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {8488#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8488#false} is VALID [2018-11-23 12:07:02,013 INFO L256 TraceCheckUtils]: 38: Hoare triple {8488#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8488#false} is VALID [2018-11-23 12:07:02,013 INFO L273 TraceCheckUtils]: 39: Hoare triple {8488#false} ~cond := #in~cond; {8488#false} is VALID [2018-11-23 12:07:02,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {8488#false} assume 0 == ~cond; {8488#false} is VALID [2018-11-23 12:07:02,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {8488#false} assume !false; {8488#false} is VALID [2018-11-23 12:07:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:02,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:02,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:02,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:03,166 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 12:07:03,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:03,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:03,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {8487#true} call ULTIMATE.init(); {8487#true} is VALID [2018-11-23 12:07:03,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {8487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8487#true} is VALID [2018-11-23 12:07:03,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {8487#true} assume true; {8487#true} is VALID [2018-11-23 12:07:03,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8487#true} {8487#true} #48#return; {8487#true} is VALID [2018-11-23 12:07:03,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {8487#true} call #t~ret4 := main(); {8487#true} is VALID [2018-11-23 12:07:03,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {8487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8489#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:03,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {8489#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8490#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:03,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {8490#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8491#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:03,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {8491#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8492#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:03,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {8492#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8493#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:03,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {8493#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8494#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:03,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {8494#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8495#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:03,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {8495#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8496#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:03,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {8496#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8497#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:03,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {8497#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8498#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:03,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {8498#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8499#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:03,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {8499#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8500#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:03,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {8500#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8501#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:03,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {8501#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8502#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:03,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {8502#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8503#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:03,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {8503#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8504#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:03,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {8504#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8505#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:03,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {8505#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8506#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:03,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {8506#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8507#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:03,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {8507#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8508#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:03,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {8508#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8509#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:03,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {8509#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8510#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:03,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {8510#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8511#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:03,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {8511#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8512#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:03,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {8512#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8513#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:03,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {8513#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8514#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:03,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {8514#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8515#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:03,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8516#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:03,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {8516#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8517#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:03,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {8517#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:03,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {8518#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8488#false} is VALID [2018-11-23 12:07:03,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {8488#false} havoc ~x~0;~x~0 := 1; {8488#false} is VALID [2018-11-23 12:07:03,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {8488#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8488#false} is VALID [2018-11-23 12:07:03,523 INFO L256 TraceCheckUtils]: 38: Hoare triple {8488#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8488#false} is VALID [2018-11-23 12:07:03,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {8488#false} ~cond := #in~cond; {8488#false} is VALID [2018-11-23 12:07:03,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {8488#false} assume 0 == ~cond; {8488#false} is VALID [2018-11-23 12:07:03,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {8488#false} assume !false; {8488#false} is VALID [2018-11-23 12:07:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:03,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:03,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 12:07:03,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-11-23 12:07:03,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:03,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:07:03,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:03,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:07:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:07:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:07:03,580 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 32 states. [2018-11-23 12:07:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:03,799 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 12:07:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:07:03,799 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-11-23 12:07:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:07:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 12:07:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:07:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 12:07:03,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 61 transitions. [2018-11-23 12:07:03,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:03,848 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:07:03,848 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:07:03,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:07:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:07:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:07:03,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:03,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 12:07:03,879 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:07:03,879 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:07:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:03,880 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:07:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:07:03,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:03,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:03,881 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:07:03,881 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:07:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:03,882 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:07:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:07:03,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:03,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:03,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:03,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:07:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 12:07:03,884 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2018-11-23 12:07:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:03,884 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 12:07:03,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:07:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:07:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:07:03,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:03,885 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:03,885 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:03,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash -703306702, now seen corresponding path program 30 times [2018-11-23 12:07:03,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:03,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:03,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:04,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {8926#true} call ULTIMATE.init(); {8926#true} is VALID [2018-11-23 12:07:04,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {8926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8926#true} is VALID [2018-11-23 12:07:04,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {8926#true} assume true; {8926#true} is VALID [2018-11-23 12:07:04,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8926#true} {8926#true} #48#return; {8926#true} is VALID [2018-11-23 12:07:04,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {8926#true} call #t~ret4 := main(); {8926#true} is VALID [2018-11-23 12:07:04,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {8926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8928#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {8928#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8929#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {8929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8930#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {8930#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8931#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {8931#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8932#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {8932#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8933#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {8933#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8934#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {8934#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8935#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {8935#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8936#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {8936#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8937#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {8937#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8938#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {8938#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8939#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {8939#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8940#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {8940#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8941#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {8941#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8942#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {8942#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8943#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {8943#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8944#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {8944#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8945#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {8945#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8946#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {8946#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8947#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {8947#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8948#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {8948#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8949#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,814 INFO L273 TraceCheckUtils]: 27: Hoare triple {8949#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8950#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {8950#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8951#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {8951#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8952#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {8952#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8953#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {8953#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8954#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {8954#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8955#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {8955#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8956#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {8956#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8957#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {8957#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8958#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {8958#(<= main_~i~0 31)} assume !(~i~0 < 100000); {8927#false} is VALID [2018-11-23 12:07:04,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {8927#false} havoc ~x~0;~x~0 := 1; {8927#false} is VALID [2018-11-23 12:07:04,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {8927#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8927#false} is VALID [2018-11-23 12:07:04,824 INFO L256 TraceCheckUtils]: 39: Hoare triple {8927#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8927#false} is VALID [2018-11-23 12:07:04,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#false} ~cond := #in~cond; {8927#false} is VALID [2018-11-23 12:07:04,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {8927#false} assume 0 == ~cond; {8927#false} is VALID [2018-11-23 12:07:04,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {8927#false} assume !false; {8927#false} is VALID [2018-11-23 12:07:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:04,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:04,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:09,326 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 12:07:09,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:09,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:09,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {8926#true} call ULTIMATE.init(); {8926#true} is VALID [2018-11-23 12:07:09,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {8926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8926#true} is VALID [2018-11-23 12:07:09,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {8926#true} assume true; {8926#true} is VALID [2018-11-23 12:07:09,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8926#true} {8926#true} #48#return; {8926#true} is VALID [2018-11-23 12:07:09,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {8926#true} call #t~ret4 := main(); {8926#true} is VALID [2018-11-23 12:07:09,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {8926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {8928#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:09,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {8928#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8929#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:09,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {8929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8930#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:09,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {8930#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8931#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:09,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {8931#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8932#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:09,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {8932#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8933#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:09,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {8933#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8934#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:09,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {8934#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8935#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:09,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {8935#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8936#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:09,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {8936#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8937#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:09,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {8937#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8938#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:09,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {8938#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8939#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:09,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {8939#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8940#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:09,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {8940#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8941#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:09,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {8941#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8942#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:09,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {8942#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8943#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:09,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {8943#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8944#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:09,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {8944#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8945#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:09,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {8945#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8946#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:09,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {8946#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8947#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:09,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {8947#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8948#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:09,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {8948#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8949#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:09,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {8949#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8950#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:09,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {8950#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8951#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:09,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {8951#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8952#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:09,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {8952#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8953#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:09,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {8953#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8954#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:09,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {8954#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8955#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:09,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {8955#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8956#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:09,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {8956#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8957#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:09,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {8957#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {8958#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:09,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {8958#(<= main_~i~0 31)} assume !(~i~0 < 100000); {8927#false} is VALID [2018-11-23 12:07:09,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {8927#false} havoc ~x~0;~x~0 := 1; {8927#false} is VALID [2018-11-23 12:07:09,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {8927#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {8927#false} is VALID [2018-11-23 12:07:09,664 INFO L256 TraceCheckUtils]: 39: Hoare triple {8927#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {8927#false} is VALID [2018-11-23 12:07:09,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#false} ~cond := #in~cond; {8927#false} is VALID [2018-11-23 12:07:09,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {8927#false} assume 0 == ~cond; {8927#false} is VALID [2018-11-23 12:07:09,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {8927#false} assume !false; {8927#false} is VALID [2018-11-23 12:07:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:09,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:09,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 12:07:09,687 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-11-23 12:07:09,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:09,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:07:09,721 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 12:07:09,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:07:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:07:09,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:07:09,723 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 33 states. [2018-11-23 12:07:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,610 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:07:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:07:10,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-11-23 12:07:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:07:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 12:07:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:07:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 12:07:10,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 62 transitions. [2018-11-23 12:07:10,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:10,662 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:07:10,662 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:07:10,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:07:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:07:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 12:07:10,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:10,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 12:07:10,687 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:07:10,687 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:07:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,688 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:07:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:07:10,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,689 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:07:10,689 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:07:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,690 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:07:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:07:10,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:10,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:07:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:07:10,692 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 43 [2018-11-23 12:07:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:10,692 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:07:10,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:07:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:07:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:07:10,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:10,693 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:10,694 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:10,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1876217326, now seen corresponding path program 31 times [2018-11-23 12:07:10,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:10,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {9375#true} call ULTIMATE.init(); {9375#true} is VALID [2018-11-23 12:07:11,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {9375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9375#true} is VALID [2018-11-23 12:07:11,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-23 12:07:11,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9375#true} {9375#true} #48#return; {9375#true} is VALID [2018-11-23 12:07:11,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {9375#true} call #t~ret4 := main(); {9375#true} is VALID [2018-11-23 12:07:11,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {9375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {9377#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {9377#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9378#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {9378#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9379#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {9379#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9380#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {9380#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9381#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {9381#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9382#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {9382#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9383#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {9383#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9384#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {9384#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9385#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {9385#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9386#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {9386#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9387#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {9387#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9388#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {9388#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9389#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {9389#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9390#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {9390#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9391#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {9391#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9392#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {9392#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9393#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {9393#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9394#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {9394#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9395#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {9395#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9396#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {9396#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9397#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {9397#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9398#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,484 INFO L273 TraceCheckUtils]: 27: Hoare triple {9398#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9399#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {9399#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9400#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {9400#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9401#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {9401#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9402#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {9402#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9403#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {9403#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9404#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,490 INFO L273 TraceCheckUtils]: 33: Hoare triple {9404#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9405#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {9405#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9406#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {9406#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9407#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {9407#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9408#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {9408#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9376#false} is VALID [2018-11-23 12:07:11,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {9376#false} havoc ~x~0;~x~0 := 1; {9376#false} is VALID [2018-11-23 12:07:11,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {9376#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {9376#false} is VALID [2018-11-23 12:07:11,494 INFO L256 TraceCheckUtils]: 40: Hoare triple {9376#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {9376#false} is VALID [2018-11-23 12:07:11,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {9376#false} ~cond := #in~cond; {9376#false} is VALID [2018-11-23 12:07:11,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {9376#false} assume 0 == ~cond; {9376#false} is VALID [2018-11-23 12:07:11,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {9376#false} assume !false; {9376#false} is VALID [2018-11-23 12:07:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:11,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:11,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:11,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {9375#true} call ULTIMATE.init(); {9375#true} is VALID [2018-11-23 12:07:11,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {9375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9375#true} is VALID [2018-11-23 12:07:11,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {9375#true} assume true; {9375#true} is VALID [2018-11-23 12:07:11,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9375#true} {9375#true} #48#return; {9375#true} is VALID [2018-11-23 12:07:11,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {9375#true} call #t~ret4 := main(); {9375#true} is VALID [2018-11-23 12:07:11,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {9375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {9377#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:11,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {9377#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9378#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:11,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {9378#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9379#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:11,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {9379#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9380#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:11,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {9380#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9381#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:11,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {9381#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9382#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:11,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {9382#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9383#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:11,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {9383#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9384#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:11,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {9384#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9385#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:11,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {9385#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9386#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:11,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {9386#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9387#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:11,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {9387#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9388#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:11,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {9388#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9389#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:11,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {9389#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9390#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:11,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {9390#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9391#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:11,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {9391#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9392#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:11,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {9392#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9393#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:11,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {9393#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9394#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:11,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {9394#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9395#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:11,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {9395#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9396#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:11,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {9396#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9397#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:11,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {9397#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9398#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:11,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {9398#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9399#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:11,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {9399#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9400#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:11,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {9400#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9401#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:11,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {9401#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9402#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:11,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {9402#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9403#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:11,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {9403#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9404#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:11,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {9404#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9405#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:11,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {9405#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9406#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:11,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {9406#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9407#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:11,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {9407#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9408#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:11,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {9408#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9376#false} is VALID [2018-11-23 12:07:11,777 INFO L273 TraceCheckUtils]: 38: Hoare triple {9376#false} havoc ~x~0;~x~0 := 1; {9376#false} is VALID [2018-11-23 12:07:11,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {9376#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {9376#false} is VALID [2018-11-23 12:07:11,777 INFO L256 TraceCheckUtils]: 40: Hoare triple {9376#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {9376#false} is VALID [2018-11-23 12:07:11,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {9376#false} ~cond := #in~cond; {9376#false} is VALID [2018-11-23 12:07:11,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {9376#false} assume 0 == ~cond; {9376#false} is VALID [2018-11-23 12:07:11,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {9376#false} assume !false; {9376#false} is VALID [2018-11-23 12:07:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:11,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:11,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 12:07:11,806 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-11-23 12:07:11,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:11,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:07:11,844 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 12:07:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:07:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:07:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:07:11,846 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 34 states. [2018-11-23 12:07:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:12,014 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 12:07:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:07:12,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-11-23 12:07:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:07:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 12:07:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:07:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 12:07:12,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 63 transitions. [2018-11-23 12:07:12,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:12,068 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:07:12,068 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:07:12,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:07:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:07:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 12:07:12,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:12,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 12:07:12,095 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:07:12,095 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:07:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:12,096 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:07:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:07:12,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:12,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:12,096 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:07:12,096 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:07:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:12,097 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:07:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:07:12,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:12,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:12,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:12,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:07:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 12:07:12,099 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-11-23 12:07:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:12,100 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 12:07:12,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:07:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:07:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:07:12,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:12,100 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:12,101 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:12,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash 237083570, now seen corresponding path program 32 times [2018-11-23 12:07:12,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:12,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:14,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {9834#true} call ULTIMATE.init(); {9834#true} is VALID [2018-11-23 12:07:14,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {9834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9834#true} is VALID [2018-11-23 12:07:14,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {9834#true} assume true; {9834#true} is VALID [2018-11-23 12:07:14,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9834#true} {9834#true} #48#return; {9834#true} is VALID [2018-11-23 12:07:14,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {9834#true} call #t~ret4 := main(); {9834#true} is VALID [2018-11-23 12:07:14,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {9834#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {9836#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:14,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {9836#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9837#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:14,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {9837#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9838#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:14,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {9838#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9839#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:14,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {9839#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9840#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:14,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {9840#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9841#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:14,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {9841#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9842#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:14,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {9842#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9843#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:14,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {9843#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9844#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:14,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {9844#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9845#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:14,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {9845#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9846#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:14,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {9846#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9847#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:14,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {9847#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9848#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:14,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {9848#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9849#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:14,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {9849#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9850#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:14,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {9850#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9851#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:14,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {9851#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9852#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:14,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {9852#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9853#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:14,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {9853#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9854#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:14,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {9854#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9855#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:14,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {9855#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9856#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:14,997 INFO L273 TraceCheckUtils]: 26: Hoare triple {9856#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9857#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:14,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {9857#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9858#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:15,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {9858#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9859#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:15,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {9859#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9860#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:15,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {9860#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9861#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:15,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {9861#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9862#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:15,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {9862#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9863#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:15,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {9863#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9864#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:15,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {9864#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9865#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:15,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {9865#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9866#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:15,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {9866#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9867#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:15,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {9867#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:15,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {9868#(<= main_~i~0 33)} assume !(~i~0 < 100000); {9835#false} is VALID [2018-11-23 12:07:15,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {9835#false} havoc ~x~0;~x~0 := 1; {9835#false} is VALID [2018-11-23 12:07:15,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {9835#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {9835#false} is VALID [2018-11-23 12:07:15,010 INFO L256 TraceCheckUtils]: 41: Hoare triple {9835#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {9835#false} is VALID [2018-11-23 12:07:15,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {9835#false} ~cond := #in~cond; {9835#false} is VALID [2018-11-23 12:07:15,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {9835#false} assume 0 == ~cond; {9835#false} is VALID [2018-11-23 12:07:15,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {9835#false} assume !false; {9835#false} is VALID [2018-11-23 12:07:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:15,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:15,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:15,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:15,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:15,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:15,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:15,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {9834#true} call ULTIMATE.init(); {9834#true} is VALID [2018-11-23 12:07:15,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {9834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9834#true} is VALID [2018-11-23 12:07:15,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {9834#true} assume true; {9834#true} is VALID [2018-11-23 12:07:15,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9834#true} {9834#true} #48#return; {9834#true} is VALID [2018-11-23 12:07:15,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {9834#true} call #t~ret4 := main(); {9834#true} is VALID [2018-11-23 12:07:15,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {9834#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {9836#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:15,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {9836#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9837#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:15,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {9837#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9838#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:15,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {9838#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9839#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:15,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {9839#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9840#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:15,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {9840#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9841#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:15,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {9841#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9842#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:15,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {9842#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9843#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:15,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {9843#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9844#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:15,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {9844#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9845#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:15,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {9845#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9846#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:15,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {9846#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9847#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:15,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {9847#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9848#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:15,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {9848#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9849#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:15,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {9849#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9850#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:15,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {9850#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9851#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:15,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {9851#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9852#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:15,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {9852#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9853#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:15,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {9853#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9854#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:15,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {9854#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9855#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:15,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {9855#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9856#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:15,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {9856#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9857#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:15,288 INFO L273 TraceCheckUtils]: 27: Hoare triple {9857#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9858#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:15,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {9858#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9859#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:15,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {9859#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9860#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:15,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {9860#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9861#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:15,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {9861#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9862#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:15,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {9862#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9863#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:15,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {9863#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9864#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:15,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {9864#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9865#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:15,296 INFO L273 TraceCheckUtils]: 35: Hoare triple {9865#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9866#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:15,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {9866#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9867#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:15,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {9867#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:15,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {9868#(<= main_~i~0 33)} assume !(~i~0 < 100000); {9835#false} is VALID [2018-11-23 12:07:15,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {9835#false} havoc ~x~0;~x~0 := 1; {9835#false} is VALID [2018-11-23 12:07:15,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {9835#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {9835#false} is VALID [2018-11-23 12:07:15,299 INFO L256 TraceCheckUtils]: 41: Hoare triple {9835#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {9835#false} is VALID [2018-11-23 12:07:15,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {9835#false} ~cond := #in~cond; {9835#false} is VALID [2018-11-23 12:07:15,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {9835#false} assume 0 == ~cond; {9835#false} is VALID [2018-11-23 12:07:15,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {9835#false} assume !false; {9835#false} is VALID [2018-11-23 12:07:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:15,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:15,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 12:07:15,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-11-23 12:07:15,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:15,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:07:15,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:15,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:07:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:07:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:07:15,360 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 35 states. [2018-11-23 12:07:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:15,633 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:07:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:07:15,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-11-23 12:07:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:07:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 12:07:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:07:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 12:07:15,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 64 transitions. [2018-11-23 12:07:15,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:15,747 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:07:15,747 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:07:15,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:07:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:07:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:07:15,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:15,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 12:07:15,779 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:07:15,779 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:07:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:15,780 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:07:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:07:15,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:15,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:15,781 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:07:15,781 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:07:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:15,782 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:07:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:07:15,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:15,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:15,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:15,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:07:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:07:15,783 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-11-23 12:07:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:15,783 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:07:15,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:07:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:07:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:07:15,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:15,784 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:15,784 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:15,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 963544686, now seen corresponding path program 33 times [2018-11-23 12:07:15,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:15,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:15,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:16,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {10303#true} call ULTIMATE.init(); {10303#true} is VALID [2018-11-23 12:07:16,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {10303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10303#true} is VALID [2018-11-23 12:07:16,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {10303#true} assume true; {10303#true} is VALID [2018-11-23 12:07:16,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10303#true} {10303#true} #48#return; {10303#true} is VALID [2018-11-23 12:07:16,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {10303#true} call #t~ret4 := main(); {10303#true} is VALID [2018-11-23 12:07:16,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {10303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {10305#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:16,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {10305#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10306#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:16,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {10306#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10307#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:16,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {10307#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10308#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:16,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {10308#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10309#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:16,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {10309#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10310#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:16,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {10310#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10311#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:16,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {10311#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10312#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:16,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {10312#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10313#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:16,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {10313#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10314#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:16,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {10314#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10315#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:16,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {10315#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10316#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:16,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {10316#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10317#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:16,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {10317#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10318#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:16,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {10318#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10319#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:16,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {10319#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10320#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:16,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {10320#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10321#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:16,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {10321#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10322#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:16,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {10322#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10323#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:16,495 INFO L273 TraceCheckUtils]: 24: Hoare triple {10323#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10324#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:16,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {10324#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10325#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:16,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {10325#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10326#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:16,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {10326#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10327#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:16,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {10327#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10328#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:16,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {10328#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10329#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:16,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {10329#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10330#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:16,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {10330#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10331#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:16,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {10331#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10332#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:16,504 INFO L273 TraceCheckUtils]: 33: Hoare triple {10332#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10333#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:16,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {10333#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10334#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:16,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {10334#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10335#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:16,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {10335#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10336#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:16,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {10336#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10337#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:16,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10338#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {10338#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {10304#false} havoc ~x~0;~x~0 := 1; {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {10304#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L256 TraceCheckUtils]: 42: Hoare triple {10304#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {10304#false} ~cond := #in~cond; {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 44: Hoare triple {10304#false} assume 0 == ~cond; {10304#false} is VALID [2018-11-23 12:07:16,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {10304#false} assume !false; {10304#false} is VALID [2018-11-23 12:07:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:16,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:16,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:23,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 12:07:23,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:23,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:23,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {10303#true} call ULTIMATE.init(); {10303#true} is VALID [2018-11-23 12:07:23,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {10303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10303#true} is VALID [2018-11-23 12:07:23,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {10303#true} assume true; {10303#true} is VALID [2018-11-23 12:07:23,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10303#true} {10303#true} #48#return; {10303#true} is VALID [2018-11-23 12:07:23,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {10303#true} call #t~ret4 := main(); {10303#true} is VALID [2018-11-23 12:07:23,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {10303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {10305#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:23,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {10305#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10306#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:23,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {10306#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10307#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:23,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {10307#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10308#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:23,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {10308#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10309#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:23,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {10309#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10310#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:23,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {10310#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10311#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:23,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {10311#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10312#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:23,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {10312#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10313#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:23,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {10313#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10314#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:23,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {10314#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10315#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:23,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {10315#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10316#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:23,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {10316#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10317#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:23,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {10317#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10318#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:23,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {10318#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10319#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:23,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {10319#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10320#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:23,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {10320#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10321#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:23,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {10321#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10322#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:23,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {10322#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10323#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:23,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {10323#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10324#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:23,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {10324#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10325#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:23,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {10325#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10326#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:23,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {10326#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10327#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:23,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {10327#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10328#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:23,705 INFO L273 TraceCheckUtils]: 29: Hoare triple {10328#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10329#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:23,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {10329#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10330#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:23,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {10330#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10331#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:23,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {10331#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10332#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:23,709 INFO L273 TraceCheckUtils]: 33: Hoare triple {10332#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10333#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:23,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {10333#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10334#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:23,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {10334#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10335#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:23,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {10335#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10336#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:23,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {10336#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10337#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:23,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10338#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:23,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {10338#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:07:23,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {10304#false} havoc ~x~0;~x~0 := 1; {10304#false} is VALID [2018-11-23 12:07:23,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {10304#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {10304#false} is VALID [2018-11-23 12:07:23,716 INFO L256 TraceCheckUtils]: 42: Hoare triple {10304#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {10304#false} is VALID [2018-11-23 12:07:23,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {10304#false} ~cond := #in~cond; {10304#false} is VALID [2018-11-23 12:07:23,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {10304#false} assume 0 == ~cond; {10304#false} is VALID [2018-11-23 12:07:23,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {10304#false} assume !false; {10304#false} is VALID [2018-11-23 12:07:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:23,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:23,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 12:07:23,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-11-23 12:07:23,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:23,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:07:23,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:07:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:07:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:07:23,773 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 36 states. [2018-11-23 12:07:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:24,353 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 12:07:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:07:24,353 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-11-23 12:07:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:07:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 12:07:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:07:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 12:07:24,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 65 transitions. [2018-11-23 12:07:24,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:24,407 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:07:24,407 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:07:24,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:07:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:07:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:07:24,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:24,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:07:24,448 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:07:24,448 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:07:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:24,449 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:07:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:07:24,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:24,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:24,450 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:07:24,450 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:07:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:24,451 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:07:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:07:24,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:24,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:24,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:24,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:07:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-23 12:07:24,453 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2018-11-23 12:07:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:24,453 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-23 12:07:24,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:07:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:07:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:07:24,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:24,454 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:24,454 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:24,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2009002802, now seen corresponding path program 34 times [2018-11-23 12:07:24,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:24,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:24,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:24,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:24,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {10782#true} call ULTIMATE.init(); {10782#true} is VALID [2018-11-23 12:07:25,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {10782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10782#true} is VALID [2018-11-23 12:07:25,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {10782#true} assume true; {10782#true} is VALID [2018-11-23 12:07:25,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10782#true} {10782#true} #48#return; {10782#true} is VALID [2018-11-23 12:07:25,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {10782#true} call #t~ret4 := main(); {10782#true} is VALID [2018-11-23 12:07:25,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {10782#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {10784#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {10784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10785#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {10785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10786#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {10786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10787#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {10787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10788#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {10788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10789#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {10789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10790#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {10790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10791#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {10791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10792#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {10792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10793#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {10793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10794#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {10794#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10795#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {10795#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10796#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {10796#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10797#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {10797#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10798#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {10798#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10799#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {10799#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10800#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {10800#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10801#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {10801#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10802#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {10802#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10803#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {10803#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10804#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {10804#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10805#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {10805#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10806#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {10806#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10807#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {10807#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10808#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {10808#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10809#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {10809#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10810#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {10810#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10811#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,399 INFO L273 TraceCheckUtils]: 33: Hoare triple {10811#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10812#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {10812#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10813#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {10813#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10814#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {10814#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10815#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {10815#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10816#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {10816#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,405 INFO L273 TraceCheckUtils]: 39: Hoare triple {10817#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10818#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {10818#(<= main_~i~0 35)} assume !(~i~0 < 100000); {10783#false} is VALID [2018-11-23 12:07:25,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {10783#false} havoc ~x~0;~x~0 := 1; {10783#false} is VALID [2018-11-23 12:07:25,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {10783#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {10783#false} is VALID [2018-11-23 12:07:25,406 INFO L256 TraceCheckUtils]: 43: Hoare triple {10783#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {10783#false} is VALID [2018-11-23 12:07:25,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {10783#false} ~cond := #in~cond; {10783#false} is VALID [2018-11-23 12:07:25,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {10783#false} assume 0 == ~cond; {10783#false} is VALID [2018-11-23 12:07:25,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {10783#false} assume !false; {10783#false} is VALID [2018-11-23 12:07:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:25,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:25,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:25,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:25,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:25,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:25,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {10782#true} call ULTIMATE.init(); {10782#true} is VALID [2018-11-23 12:07:25,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {10782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10782#true} is VALID [2018-11-23 12:07:25,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {10782#true} assume true; {10782#true} is VALID [2018-11-23 12:07:25,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10782#true} {10782#true} #48#return; {10782#true} is VALID [2018-11-23 12:07:25,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {10782#true} call #t~ret4 := main(); {10782#true} is VALID [2018-11-23 12:07:25,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {10782#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {10784#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:25,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {10784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10785#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:25,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {10785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10786#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:25,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {10786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10787#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:25,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {10787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10788#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:25,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {10788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10789#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:25,664 INFO L273 TraceCheckUtils]: 11: Hoare triple {10789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10790#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:25,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {10790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10791#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:25,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {10791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10792#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:25,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {10792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10793#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:25,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {10793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10794#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:25,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {10794#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10795#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:25,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {10795#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10796#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:25,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {10796#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10797#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:25,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {10797#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10798#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:25,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {10798#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10799#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:25,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {10799#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10800#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:25,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {10800#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10801#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:25,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {10801#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10802#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:25,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {10802#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10803#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:25,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {10803#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10804#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:25,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {10804#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10805#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:25,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {10805#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10806#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:25,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {10806#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10807#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:25,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {10807#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10808#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:25,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {10808#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10809#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:25,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {10809#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10810#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:25,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {10810#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10811#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:25,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {10811#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10812#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:25,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {10812#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10813#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:25,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {10813#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10814#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:25,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {10814#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10815#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:25,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {10815#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10816#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:25,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {10816#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10817#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:25,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {10817#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {10818#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:25,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {10818#(<= main_~i~0 35)} assume !(~i~0 < 100000); {10783#false} is VALID [2018-11-23 12:07:25,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {10783#false} havoc ~x~0;~x~0 := 1; {10783#false} is VALID [2018-11-23 12:07:25,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {10783#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {10783#false} is VALID [2018-11-23 12:07:25,694 INFO L256 TraceCheckUtils]: 43: Hoare triple {10783#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {10783#false} is VALID [2018-11-23 12:07:25,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {10783#false} ~cond := #in~cond; {10783#false} is VALID [2018-11-23 12:07:25,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {10783#false} assume 0 == ~cond; {10783#false} is VALID [2018-11-23 12:07:25,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {10783#false} assume !false; {10783#false} is VALID [2018-11-23 12:07:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:25,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:25,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 12:07:25,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2018-11-23 12:07:25,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:25,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:07:25,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:25,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:07:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:07:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:25,753 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 37 states. [2018-11-23 12:07:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:25,936 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:07:25,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:07:25,936 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2018-11-23 12:07:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 12:07:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 12:07:25,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 66 transitions. [2018-11-23 12:07:25,989 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 12:07:25,990 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:07:25,990 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:07:25,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:07:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 12:07:26,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:26,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 12:07:26,018 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 12:07:26,018 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 12:07:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:26,019 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:07:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:07:26,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:26,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:26,019 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 12:07:26,019 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 12:07:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:26,020 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:07:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:07:26,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:26,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:26,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:26,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:07:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 12:07:26,021 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2018-11-23 12:07:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:26,022 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 12:07:26,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:07:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:07:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:07:26,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:26,023 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:26,023 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:26,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 58466030, now seen corresponding path program 35 times [2018-11-23 12:07:26,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:26,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:26,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-23 12:07:26,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-23 12:07:26,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-23 12:07:26,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #48#return; {11271#true} is VALID [2018-11-23 12:07:26,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret4 := main(); {11271#true} is VALID [2018-11-23 12:07:26,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {11273#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:26,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {11273#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11274#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:26,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {11274#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11275#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:26,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {11275#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11276#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:26,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {11276#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11277#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:26,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {11277#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11278#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:26,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {11278#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11279#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:26,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {11279#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:26,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {11280#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:26,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:26,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {11282#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:26,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {11283#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:26,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {11284#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:26,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {11285#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:26,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {11286#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:26,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {11287#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:26,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {11288#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:26,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {11289#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:26,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {11290#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11291#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:26,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {11291#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11292#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:26,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {11292#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11293#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:26,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {11293#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11294#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:26,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {11294#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11295#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:26,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {11295#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11296#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:26,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {11296#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11297#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:26,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {11297#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11298#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:26,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {11298#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11299#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:26,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {11299#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11300#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:26,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {11300#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11301#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:26,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {11301#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11302#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:26,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {11302#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11303#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:26,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {11303#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11304#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:26,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {11304#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11305#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:26,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {11305#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11306#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:26,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {11306#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11307#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:26,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {11307#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11308#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:26,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {11308#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-23 12:07:26,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {11272#false} havoc ~x~0;~x~0 := 1; {11272#false} is VALID [2018-11-23 12:07:26,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {11272#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {11272#false} is VALID [2018-11-23 12:07:26,852 INFO L256 TraceCheckUtils]: 44: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {11272#false} is VALID [2018-11-23 12:07:26,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-23 12:07:26,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {11272#false} assume 0 == ~cond; {11272#false} is VALID [2018-11-23 12:07:26,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-23 12:07:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:26,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:26,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:31,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:07:31,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:31,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:31,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-23 12:07:31,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-23 12:07:31,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-23 12:07:31,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #48#return; {11271#true} is VALID [2018-11-23 12:07:31,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret4 := main(); {11271#true} is VALID [2018-11-23 12:07:31,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {11273#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {11273#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11274#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {11274#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11275#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {11275#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11276#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {11276#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11277#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {11277#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11278#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {11278#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11279#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {11279#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {11280#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {11282#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {11283#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {11284#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {11285#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {11286#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {11287#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {11288#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {11289#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {11290#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11291#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {11291#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11292#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {11292#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11293#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {11293#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11294#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {11294#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11295#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {11295#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11296#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {11296#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11297#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {11297#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11298#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {11298#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11299#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {11299#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11300#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {11300#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11301#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {11301#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11302#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {11302#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11303#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {11303#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11304#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {11304#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11305#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {11305#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11306#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {11306#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11307#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {11307#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11308#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:31,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {11308#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-23 12:07:31,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {11272#false} havoc ~x~0;~x~0 := 1; {11272#false} is VALID [2018-11-23 12:07:31,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {11272#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {11272#false} is VALID [2018-11-23 12:07:31,560 INFO L256 TraceCheckUtils]: 44: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {11272#false} is VALID [2018-11-23 12:07:31,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-23 12:07:31,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {11272#false} assume 0 == ~cond; {11272#false} is VALID [2018-11-23 12:07:31,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-23 12:07:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 12:07:31,585 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2018-11-23 12:07:31,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:31,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:07:31,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:31,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:07:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:07:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:31,625 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 38 states. [2018-11-23 12:07:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,232 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 12:07:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:07:32,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2018-11-23 12:07:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 12:07:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 12:07:32,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 67 transitions. [2018-11-23 12:07:32,321 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 12:07:32,323 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:07:32,323 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:07:32,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:07:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 12:07:32,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:32,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 12:07:32,356 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:07:32,356 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:07:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,358 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:07:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:07:32,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,358 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:07:32,358 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:07:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,359 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:07:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:07:32,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:32,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:07:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 12:07:32,361 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2018-11-23 12:07:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:32,362 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 12:07:32,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:07:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:07:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:07:32,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:32,363 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:32,363 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:32,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash -278631758, now seen corresponding path program 36 times [2018-11-23 12:07:32,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:32,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:32,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:32,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:33,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {11770#true} call ULTIMATE.init(); {11770#true} is VALID [2018-11-23 12:07:33,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {11770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11770#true} is VALID [2018-11-23 12:07:33,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {11770#true} assume true; {11770#true} is VALID [2018-11-23 12:07:33,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11770#true} {11770#true} #48#return; {11770#true} is VALID [2018-11-23 12:07:33,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {11770#true} call #t~ret4 := main(); {11770#true} is VALID [2018-11-23 12:07:33,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {11770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {11772#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:33,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {11772#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11773#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:33,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {11773#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11774#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:33,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {11774#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11775#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:33,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {11775#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11776#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:33,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {11776#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11777#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:33,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {11777#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11778#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:33,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {11778#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11779#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:33,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {11779#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11780#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:33,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {11780#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11781#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:33,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {11781#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11782#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:33,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {11782#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11783#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:33,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {11783#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11784#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:33,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {11784#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11785#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:33,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {11785#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11786#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:33,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {11786#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11787#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:33,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {11787#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11788#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:33,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {11788#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11789#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:33,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {11789#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11790#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:33,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {11790#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11791#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:33,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {11791#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11792#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:33,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {11792#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11793#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:33,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {11793#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11794#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:33,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {11794#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11795#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:33,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {11795#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11796#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:33,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {11796#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11797#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:33,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {11797#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11798#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:33,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {11798#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11799#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:33,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {11799#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11800#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:33,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {11800#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11801#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:33,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {11801#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11802#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:33,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {11802#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11803#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:33,428 INFO L273 TraceCheckUtils]: 37: Hoare triple {11803#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11804#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:33,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {11804#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11805#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:33,430 INFO L273 TraceCheckUtils]: 39: Hoare triple {11805#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11806#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:33,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {11806#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11807#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:33,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {11807#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11808#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:33,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {11808#(<= main_~i~0 37)} assume !(~i~0 < 100000); {11771#false} is VALID [2018-11-23 12:07:33,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {11771#false} havoc ~x~0;~x~0 := 1; {11771#false} is VALID [2018-11-23 12:07:33,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {11771#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {11771#false} is VALID [2018-11-23 12:07:33,433 INFO L256 TraceCheckUtils]: 45: Hoare triple {11771#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {11771#false} is VALID [2018-11-23 12:07:33,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {11771#false} ~cond := #in~cond; {11771#false} is VALID [2018-11-23 12:07:33,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {11771#false} assume 0 == ~cond; {11771#false} is VALID [2018-11-23 12:07:33,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {11771#false} assume !false; {11771#false} is VALID [2018-11-23 12:07:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:33,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:33,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:41,607 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:07:41,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:41,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:42,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {11770#true} call ULTIMATE.init(); {11770#true} is VALID [2018-11-23 12:07:42,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {11770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11770#true} is VALID [2018-11-23 12:07:42,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {11770#true} assume true; {11770#true} is VALID [2018-11-23 12:07:42,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11770#true} {11770#true} #48#return; {11770#true} is VALID [2018-11-23 12:07:42,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {11770#true} call #t~ret4 := main(); {11770#true} is VALID [2018-11-23 12:07:42,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {11770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {11772#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:42,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {11772#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11773#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:42,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {11773#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11774#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:42,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {11774#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11775#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:42,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {11775#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11776#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:42,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {11776#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11777#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:42,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {11777#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11778#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:42,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {11778#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11779#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:42,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {11779#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11780#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:42,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {11780#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11781#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:42,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {11781#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11782#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:42,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {11782#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11783#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:42,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {11783#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11784#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:42,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {11784#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11785#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:42,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {11785#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11786#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:42,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {11786#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11787#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:42,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {11787#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11788#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:42,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {11788#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11789#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:42,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {11789#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11790#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:42,181 INFO L273 TraceCheckUtils]: 24: Hoare triple {11790#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11791#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:42,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {11791#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11792#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:42,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {11792#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11793#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:42,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {11793#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11794#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:42,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {11794#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11795#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:42,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {11795#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11796#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:42,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {11796#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11797#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:42,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {11797#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11798#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:42,189 INFO L273 TraceCheckUtils]: 32: Hoare triple {11798#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11799#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:42,190 INFO L273 TraceCheckUtils]: 33: Hoare triple {11799#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11800#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:42,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {11800#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11801#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:42,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {11801#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11802#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:42,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {11802#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11803#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:42,194 INFO L273 TraceCheckUtils]: 37: Hoare triple {11803#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11804#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:42,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {11804#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11805#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:42,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {11805#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11806#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:42,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {11806#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11807#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:42,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {11807#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {11808#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:42,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {11808#(<= main_~i~0 37)} assume !(~i~0 < 100000); {11771#false} is VALID [2018-11-23 12:07:42,199 INFO L273 TraceCheckUtils]: 43: Hoare triple {11771#false} havoc ~x~0;~x~0 := 1; {11771#false} is VALID [2018-11-23 12:07:42,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {11771#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {11771#false} is VALID [2018-11-23 12:07:42,200 INFO L256 TraceCheckUtils]: 45: Hoare triple {11771#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {11771#false} is VALID [2018-11-23 12:07:42,200 INFO L273 TraceCheckUtils]: 46: Hoare triple {11771#false} ~cond := #in~cond; {11771#false} is VALID [2018-11-23 12:07:42,200 INFO L273 TraceCheckUtils]: 47: Hoare triple {11771#false} assume 0 == ~cond; {11771#false} is VALID [2018-11-23 12:07:42,200 INFO L273 TraceCheckUtils]: 48: Hoare triple {11771#false} assume !false; {11771#false} is VALID [2018-11-23 12:07:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:42,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:42,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 12:07:42,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2018-11-23 12:07:42,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:42,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:07:42,261 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 12:07:42,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:07:42,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:07:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:42,263 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 39 states. [2018-11-23 12:07:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:42,782 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:07:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:07:42,782 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2018-11-23 12:07:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 12:07:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 12:07:42,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 68 transitions. [2018-11-23 12:07:42,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:42,878 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:07:42,878 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:07:42,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:07:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 12:07:42,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:42,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 12:07:42,913 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:07:42,913 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:07:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:42,915 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:07:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:07:42,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:42,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:42,915 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:07:42,916 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:07:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:42,916 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:07:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:07:42,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:42,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:42,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:42,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:07:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 12:07:42,918 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-11-23 12:07:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:42,918 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 12:07:42,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:07:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:07:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:07:42,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:42,919 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:42,919 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:42,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2138728594, now seen corresponding path program 37 times [2018-11-23 12:07:42,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:42,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:42,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:42,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {12279#true} call ULTIMATE.init(); {12279#true} is VALID [2018-11-23 12:07:46,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {12279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12279#true} is VALID [2018-11-23 12:07:46,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {12279#true} assume true; {12279#true} is VALID [2018-11-23 12:07:46,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12279#true} {12279#true} #48#return; {12279#true} is VALID [2018-11-23 12:07:46,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {12279#true} call #t~ret4 := main(); {12279#true} is VALID [2018-11-23 12:07:46,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {12279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {12281#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:46,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {12281#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12282#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:46,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {12282#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12283#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:46,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {12283#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12284#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:46,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {12284#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12285#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:46,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {12285#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12286#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:46,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {12286#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12287#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:46,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {12287#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12288#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:46,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {12288#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12289#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:46,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {12289#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12290#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:46,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {12290#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12291#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:46,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {12291#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12292#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:46,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {12292#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12293#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:46,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {12293#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12294#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:46,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {12294#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12295#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:46,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {12295#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12296#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:46,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {12296#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12297#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:46,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {12297#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12298#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:46,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {12298#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12299#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:46,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {12299#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12300#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:46,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {12300#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12301#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:46,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {12301#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12302#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:46,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {12302#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12303#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:46,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {12303#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12304#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:46,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {12304#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12305#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:46,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {12305#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12306#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:46,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {12306#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12307#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:46,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {12307#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12308#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:46,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {12308#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12309#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:46,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {12309#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12310#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:46,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {12310#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12311#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:46,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {12311#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12312#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:46,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {12312#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12313#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:46,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {12313#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12314#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:46,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {12314#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12315#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:46,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {12315#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12316#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:46,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {12316#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12317#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:46,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {12317#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12318#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:46,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {12318#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12280#false} is VALID [2018-11-23 12:07:46,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {12280#false} havoc ~x~0;~x~0 := 1; {12280#false} is VALID [2018-11-23 12:07:46,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {12280#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {12280#false} is VALID [2018-11-23 12:07:46,153 INFO L256 TraceCheckUtils]: 46: Hoare triple {12280#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {12280#false} is VALID [2018-11-23 12:07:46,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {12280#false} ~cond := #in~cond; {12280#false} is VALID [2018-11-23 12:07:46,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {12280#false} assume 0 == ~cond; {12280#false} is VALID [2018-11-23 12:07:46,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {12280#false} assume !false; {12280#false} is VALID [2018-11-23 12:07:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:46,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:46,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:46,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:46,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:46,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {12279#true} call ULTIMATE.init(); {12279#true} is VALID [2018-11-23 12:07:46,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {12279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12279#true} is VALID [2018-11-23 12:07:46,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {12279#true} assume true; {12279#true} is VALID [2018-11-23 12:07:46,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12279#true} {12279#true} #48#return; {12279#true} is VALID [2018-11-23 12:07:46,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {12279#true} call #t~ret4 := main(); {12279#true} is VALID [2018-11-23 12:07:46,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {12279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {12281#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:46,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {12281#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12282#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:46,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {12282#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12283#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:46,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {12283#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12284#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:46,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {12284#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12285#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:46,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {12285#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12286#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:46,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {12286#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12287#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:46,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {12287#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12288#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:46,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {12288#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12289#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:46,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {12289#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12290#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:46,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {12290#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12291#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:46,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {12291#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12292#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:46,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {12292#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12293#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:46,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {12293#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12294#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:46,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {12294#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12295#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:46,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {12295#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12296#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:46,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {12296#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12297#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:46,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {12297#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12298#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:46,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {12298#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12299#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:46,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {12299#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12300#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:46,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {12300#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12301#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:46,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {12301#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12302#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:46,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {12302#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12303#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:46,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {12303#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12304#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:46,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {12304#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12305#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:46,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {12305#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12306#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:46,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {12306#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12307#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:46,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {12307#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12308#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:46,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {12308#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12309#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:46,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {12309#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12310#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:46,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {12310#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12311#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:46,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {12311#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12312#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:46,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {12312#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12313#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:46,522 INFO L273 TraceCheckUtils]: 38: Hoare triple {12313#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12314#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:46,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {12314#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12315#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:46,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {12315#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12316#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:46,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {12316#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12317#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:46,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {12317#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12318#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:46,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {12318#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12280#false} is VALID [2018-11-23 12:07:46,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {12280#false} havoc ~x~0;~x~0 := 1; {12280#false} is VALID [2018-11-23 12:07:46,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {12280#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {12280#false} is VALID [2018-11-23 12:07:46,527 INFO L256 TraceCheckUtils]: 46: Hoare triple {12280#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {12280#false} is VALID [2018-11-23 12:07:46,527 INFO L273 TraceCheckUtils]: 47: Hoare triple {12280#false} ~cond := #in~cond; {12280#false} is VALID [2018-11-23 12:07:46,528 INFO L273 TraceCheckUtils]: 48: Hoare triple {12280#false} assume 0 == ~cond; {12280#false} is VALID [2018-11-23 12:07:46,528 INFO L273 TraceCheckUtils]: 49: Hoare triple {12280#false} assume !false; {12280#false} is VALID [2018-11-23 12:07:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 12:07:46,549 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-11-23 12:07:46,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:46,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:07:46,592 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 12:07:46,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:07:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:07:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:07:46,594 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 40 states. [2018-11-23 12:07:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:47,082 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 12:07:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:07:47,082 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-11-23 12:07:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:07:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 12:07:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:07:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 12:07:47,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 69 transitions. [2018-11-23 12:07:47,148 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 12:07:47,149 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:07:47,149 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:07:47,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:07:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:07:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:07:47,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:47,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:07:47,178 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:07:47,178 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:07:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:47,179 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:07:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:07:47,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:47,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:47,180 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:07:47,180 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:07:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:47,181 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:07:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:07:47,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:47,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:47,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:47,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:07:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 12:07:47,182 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-11-23 12:07:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:47,182 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 12:07:47,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:07:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:07:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:07:47,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:47,183 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:47,183 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:47,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 327811634, now seen corresponding path program 38 times [2018-11-23 12:07:47,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:47,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:47,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:47,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:47,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:47,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {12798#true} call ULTIMATE.init(); {12798#true} is VALID [2018-11-23 12:07:47,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {12798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12798#true} is VALID [2018-11-23 12:07:47,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {12798#true} assume true; {12798#true} is VALID [2018-11-23 12:07:47,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12798#true} {12798#true} #48#return; {12798#true} is VALID [2018-11-23 12:07:47,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {12798#true} call #t~ret4 := main(); {12798#true} is VALID [2018-11-23 12:07:47,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {12798#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {12800#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:47,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {12800#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12801#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:47,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {12801#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12802#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:47,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {12802#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12803#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:47,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {12803#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12804#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:47,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {12804#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12805#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:47,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {12805#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12806#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:47,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {12806#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12807#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:47,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {12807#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12808#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:47,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {12808#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12809#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:47,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {12809#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12810#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:47,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {12810#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12811#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:47,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {12811#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12812#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:47,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {12812#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12813#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:47,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {12813#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12814#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:47,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {12814#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12815#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:47,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {12815#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12816#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:47,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {12816#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12817#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:47,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {12817#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12818#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:47,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {12818#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12819#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:47,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {12819#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12820#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:47,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {12820#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12821#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:47,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {12821#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12822#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:47,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {12822#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12823#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:47,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {12823#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12824#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:47,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {12824#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12825#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:47,989 INFO L273 TraceCheckUtils]: 31: Hoare triple {12825#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12826#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:47,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {12826#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12827#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:47,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {12827#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12828#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:48,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {12828#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12829#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:48,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {12829#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12830#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:48,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {12830#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12831#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:48,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {12831#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12832#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:48,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {12832#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12833#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:48,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {12833#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12834#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:48,039 INFO L273 TraceCheckUtils]: 40: Hoare triple {12834#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12835#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:48,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {12835#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12836#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:48,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {12836#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12837#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:48,041 INFO L273 TraceCheckUtils]: 43: Hoare triple {12837#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12838#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:48,041 INFO L273 TraceCheckUtils]: 44: Hoare triple {12838#(<= main_~i~0 39)} assume !(~i~0 < 100000); {12799#false} is VALID [2018-11-23 12:07:48,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {12799#false} havoc ~x~0;~x~0 := 1; {12799#false} is VALID [2018-11-23 12:07:48,041 INFO L273 TraceCheckUtils]: 46: Hoare triple {12799#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {12799#false} is VALID [2018-11-23 12:07:48,041 INFO L256 TraceCheckUtils]: 47: Hoare triple {12799#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {12799#false} is VALID [2018-11-23 12:07:48,041 INFO L273 TraceCheckUtils]: 48: Hoare triple {12799#false} ~cond := #in~cond; {12799#false} is VALID [2018-11-23 12:07:48,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {12799#false} assume 0 == ~cond; {12799#false} is VALID [2018-11-23 12:07:48,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {12799#false} assume !false; {12799#false} is VALID [2018-11-23 12:07:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:48,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:48,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:48,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:48,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:48,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:48,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {12798#true} call ULTIMATE.init(); {12798#true} is VALID [2018-11-23 12:07:48,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {12798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12798#true} is VALID [2018-11-23 12:07:48,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {12798#true} assume true; {12798#true} is VALID [2018-11-23 12:07:48,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12798#true} {12798#true} #48#return; {12798#true} is VALID [2018-11-23 12:07:48,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {12798#true} call #t~ret4 := main(); {12798#true} is VALID [2018-11-23 12:07:48,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {12798#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {12800#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:48,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {12800#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12801#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:48,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {12801#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12802#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:48,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {12802#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12803#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:48,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {12803#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12804#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:48,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {12804#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12805#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:48,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {12805#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12806#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:48,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {12806#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12807#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:48,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {12807#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12808#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:48,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {12808#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12809#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:48,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {12809#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12810#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:48,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {12810#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12811#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:48,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {12811#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12812#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:48,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {12812#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12813#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:48,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {12813#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12814#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:48,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {12814#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12815#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:48,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {12815#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12816#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:48,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {12816#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12817#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:48,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {12817#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12818#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:48,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {12818#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12819#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:48,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {12819#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12820#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:48,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {12820#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12821#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:48,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {12821#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12822#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:48,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {12822#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12823#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:48,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {12823#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12824#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:48,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {12824#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12825#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:48,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {12825#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12826#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:48,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {12826#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12827#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:48,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {12827#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12828#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:48,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {12828#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12829#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:48,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {12829#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12830#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:48,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {12830#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12831#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:48,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {12831#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12832#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:48,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {12832#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12833#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:48,585 INFO L273 TraceCheckUtils]: 39: Hoare triple {12833#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12834#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:48,586 INFO L273 TraceCheckUtils]: 40: Hoare triple {12834#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12835#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:48,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {12835#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12836#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:48,587 INFO L273 TraceCheckUtils]: 42: Hoare triple {12836#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12837#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:48,593 INFO L273 TraceCheckUtils]: 43: Hoare triple {12837#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {12838#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {12838#(<= main_~i~0 39)} assume !(~i~0 < 100000); {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 45: Hoare triple {12799#false} havoc ~x~0;~x~0 := 1; {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 46: Hoare triple {12799#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L256 TraceCheckUtils]: 47: Hoare triple {12799#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 48: Hoare triple {12799#false} ~cond := #in~cond; {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 49: Hoare triple {12799#false} assume 0 == ~cond; {12799#false} is VALID [2018-11-23 12:07:48,594 INFO L273 TraceCheckUtils]: 50: Hoare triple {12799#false} assume !false; {12799#false} is VALID [2018-11-23 12:07:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:48,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 12:07:48,616 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2018-11-23 12:07:48,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:48,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:07:48,655 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 12:07:48,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:07:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:07:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:07:48,657 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 41 states. [2018-11-23 12:07:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:49,263 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:07:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:07:49,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2018-11-23 12:07:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:07:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 12:07:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:07:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 12:07:49,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 70 transitions. [2018-11-23 12:07:49,318 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 12:07:49,320 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:07:49,320 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:07:49,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:07:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:07:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:07:49,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:49,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 12:07:49,357 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:07:49,358 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:07:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:49,359 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:07:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:07:49,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:49,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:49,359 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:07:49,359 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:07:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:49,360 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:07:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:07:49,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:49,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:49,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:49,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:07:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 12:07:49,362 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 51 [2018-11-23 12:07:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:49,362 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 12:07:49,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:07:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:07:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:07:49,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:49,363 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:49,363 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:49,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash -518852626, now seen corresponding path program 39 times [2018-11-23 12:07:49,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:49,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:49,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:50,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {13327#true} call ULTIMATE.init(); {13327#true} is VALID [2018-11-23 12:07:50,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {13327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13327#true} is VALID [2018-11-23 12:07:50,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {13327#true} assume true; {13327#true} is VALID [2018-11-23 12:07:50,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13327#true} {13327#true} #48#return; {13327#true} is VALID [2018-11-23 12:07:50,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {13327#true} call #t~ret4 := main(); {13327#true} is VALID [2018-11-23 12:07:50,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {13327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {13329#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:50,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {13329#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13330#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:50,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {13330#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13331#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:50,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {13331#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13332#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:50,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {13332#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13333#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:50,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {13333#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13334#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:50,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {13334#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13335#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:50,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {13335#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13336#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:50,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {13336#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13337#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:50,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {13337#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13338#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:50,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {13338#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13339#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:50,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {13339#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13340#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:50,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {13340#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13341#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:50,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {13341#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13342#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:50,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {13342#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13343#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:50,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {13343#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13344#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:50,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {13344#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13345#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:50,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {13345#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13346#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:50,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {13346#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13347#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:50,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {13347#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13348#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:50,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {13348#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13349#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:50,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {13349#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13350#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:50,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {13350#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13351#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:50,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {13351#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13352#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:50,525 INFO L273 TraceCheckUtils]: 29: Hoare triple {13352#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13353#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:50,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {13353#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13354#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:50,527 INFO L273 TraceCheckUtils]: 31: Hoare triple {13354#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13355#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:50,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {13355#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13356#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:50,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {13356#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13357#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:50,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {13357#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13358#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:50,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {13358#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13359#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:50,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {13359#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13360#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:50,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {13360#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13361#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:50,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {13361#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13362#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:50,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {13362#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13363#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:50,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {13363#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13364#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:50,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {13364#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13365#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:50,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {13365#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13366#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:50,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {13366#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13367#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:50,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {13367#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13368#(<= main_~i~0 40)} is VALID [2018-11-23 12:07:50,541 INFO L273 TraceCheckUtils]: 45: Hoare triple {13368#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13328#false} is VALID [2018-11-23 12:07:50,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {13328#false} havoc ~x~0;~x~0 := 1; {13328#false} is VALID [2018-11-23 12:07:50,541 INFO L273 TraceCheckUtils]: 47: Hoare triple {13328#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {13328#false} is VALID [2018-11-23 12:07:50,541 INFO L256 TraceCheckUtils]: 48: Hoare triple {13328#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {13328#false} is VALID [2018-11-23 12:07:50,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {13328#false} ~cond := #in~cond; {13328#false} is VALID [2018-11-23 12:07:50,542 INFO L273 TraceCheckUtils]: 50: Hoare triple {13328#false} assume 0 == ~cond; {13328#false} is VALID [2018-11-23 12:07:50,542 INFO L273 TraceCheckUtils]: 51: Hoare triple {13328#false} assume !false; {13328#false} is VALID [2018-11-23 12:07:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:50,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:50,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:07:50,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:02,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 12:08:02,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:02,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:03,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {13327#true} call ULTIMATE.init(); {13327#true} is VALID [2018-11-23 12:08:03,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {13327#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13327#true} is VALID [2018-11-23 12:08:03,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {13327#true} assume true; {13327#true} is VALID [2018-11-23 12:08:03,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13327#true} {13327#true} #48#return; {13327#true} is VALID [2018-11-23 12:08:03,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {13327#true} call #t~ret4 := main(); {13327#true} is VALID [2018-11-23 12:08:03,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {13327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {13329#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:03,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {13329#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13330#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:03,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {13330#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13331#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:03,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {13331#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13332#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:03,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {13332#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13333#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:03,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {13333#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13334#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:03,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {13334#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13335#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:03,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {13335#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13336#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:03,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {13336#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13337#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:03,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {13337#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13338#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:03,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {13338#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13339#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:03,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {13339#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13340#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:03,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {13340#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13341#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:03,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {13341#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13342#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:03,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {13342#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13343#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:03,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {13343#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13344#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:03,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {13344#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13345#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:03,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {13345#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13346#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:03,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {13346#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13347#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:03,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {13347#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13348#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:03,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {13348#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13349#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:03,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {13349#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13350#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:03,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {13350#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13351#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:03,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {13351#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13352#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:03,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {13352#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13353#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:03,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {13353#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13354#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:03,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {13354#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13355#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:03,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {13355#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13356#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:03,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {13356#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13357#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:03,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {13357#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13358#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:03,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {13358#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13359#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:03,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {13359#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13360#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:03,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {13360#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13361#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:03,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {13361#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13362#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:03,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {13362#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13363#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:03,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {13363#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13364#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:03,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {13364#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13365#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:03,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {13365#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13366#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:03,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {13366#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13367#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:03,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {13367#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13368#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:03,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {13368#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13328#false} is VALID [2018-11-23 12:08:03,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {13328#false} havoc ~x~0;~x~0 := 1; {13328#false} is VALID [2018-11-23 12:08:03,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {13328#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {13328#false} is VALID [2018-11-23 12:08:03,101 INFO L256 TraceCheckUtils]: 48: Hoare triple {13328#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {13328#false} is VALID [2018-11-23 12:08:03,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {13328#false} ~cond := #in~cond; {13328#false} is VALID [2018-11-23 12:08:03,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {13328#false} assume 0 == ~cond; {13328#false} is VALID [2018-11-23 12:08:03,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {13328#false} assume !false; {13328#false} is VALID [2018-11-23 12:08:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:03,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-23 12:08:03,129 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2018-11-23 12:08:03,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:03,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:08:03,190 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 12:08:03,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:08:03,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:08:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:08:03,192 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 42 states. [2018-11-23 12:08:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,103 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 12:08:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:08:04,104 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2018-11-23 12:08:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 12:08:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 12:08:04,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 71 transitions. [2018-11-23 12:08:04,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:04,175 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:08:04,175 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:08:04,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:08:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:08:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:08:04,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:04,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:04,211 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:04,211 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,213 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:08:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:08:04,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:04,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:04,213 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:04,213 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:08:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:04,214 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:08:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:08:04,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:04,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:04,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:04,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:08:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-23 12:08:04,215 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-11-23 12:08:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:04,215 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-23 12:08:04,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:08:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:08:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:08:04,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:04,216 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:04,216 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:04,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash -995640910, now seen corresponding path program 40 times [2018-11-23 12:08:04,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:04,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:04,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:04,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:05,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {13866#true} call ULTIMATE.init(); {13866#true} is VALID [2018-11-23 12:08:05,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {13866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13866#true} is VALID [2018-11-23 12:08:05,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {13866#true} assume true; {13866#true} is VALID [2018-11-23 12:08:05,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13866#true} {13866#true} #48#return; {13866#true} is VALID [2018-11-23 12:08:05,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {13866#true} call #t~ret4 := main(); {13866#true} is VALID [2018-11-23 12:08:05,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {13866#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {13868#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:05,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {13868#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13869#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:05,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {13869#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13870#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:05,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {13870#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13871#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:05,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {13871#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13872#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:05,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {13872#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13873#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:05,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {13873#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13874#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:05,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {13874#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13875#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:05,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {13875#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13876#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:05,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {13876#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13877#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:05,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {13877#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13878#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:05,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {13878#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13879#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:05,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {13879#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13880#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:05,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {13880#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13881#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:05,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {13881#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13882#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:05,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {13882#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13883#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:05,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {13883#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13884#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:05,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {13884#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13885#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:05,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {13885#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13886#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:05,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {13886#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13887#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:05,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {13887#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13888#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:05,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {13888#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13889#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:05,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {13889#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13890#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:05,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {13890#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13891#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:05,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {13891#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13892#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:05,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {13892#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13893#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:05,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {13893#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13894#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:05,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {13894#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13895#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:05,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {13895#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13896#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:05,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {13896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13897#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:05,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {13897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13898#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:05,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {13898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13899#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:05,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {13899#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13900#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:05,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {13900#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13901#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:05,355 INFO L273 TraceCheckUtils]: 39: Hoare triple {13901#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13902#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:05,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {13902#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13903#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:05,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {13903#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13904#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:05,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {13904#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13905#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:05,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {13905#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13906#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:05,360 INFO L273 TraceCheckUtils]: 44: Hoare triple {13906#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13907#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:05,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {13907#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13908#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:05,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {13908#(<= main_~i~0 41)} assume !(~i~0 < 100000); {13867#false} is VALID [2018-11-23 12:08:05,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {13867#false} havoc ~x~0;~x~0 := 1; {13867#false} is VALID [2018-11-23 12:08:05,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {13867#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {13867#false} is VALID [2018-11-23 12:08:05,363 INFO L256 TraceCheckUtils]: 49: Hoare triple {13867#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {13867#false} is VALID [2018-11-23 12:08:05,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {13867#false} ~cond := #in~cond; {13867#false} is VALID [2018-11-23 12:08:05,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {13867#false} assume 0 == ~cond; {13867#false} is VALID [2018-11-23 12:08:05,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {13867#false} assume !false; {13867#false} is VALID [2018-11-23 12:08:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:05,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:05,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:05,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:05,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:05,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:05,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:05,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {13866#true} call ULTIMATE.init(); {13866#true} is VALID [2018-11-23 12:08:05,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {13866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13866#true} is VALID [2018-11-23 12:08:05,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {13866#true} assume true; {13866#true} is VALID [2018-11-23 12:08:05,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13866#true} {13866#true} #48#return; {13866#true} is VALID [2018-11-23 12:08:05,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {13866#true} call #t~ret4 := main(); {13866#true} is VALID [2018-11-23 12:08:05,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {13866#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {13868#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:05,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {13868#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13869#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:05,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {13869#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13870#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:05,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {13870#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13871#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:05,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {13871#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13872#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:05,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {13872#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13873#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:05,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {13873#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13874#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:05,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {13874#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13875#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:05,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {13875#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13876#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:05,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {13876#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13877#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:05,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {13877#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13878#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:05,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {13878#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13879#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:05,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {13879#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13880#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:05,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {13880#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13881#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:05,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {13881#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13882#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:05,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {13882#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13883#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:05,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {13883#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13884#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:05,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {13884#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13885#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:05,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {13885#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13886#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:05,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {13886#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13887#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:05,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {13887#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13888#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:05,899 INFO L273 TraceCheckUtils]: 26: Hoare triple {13888#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13889#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:05,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {13889#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13890#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:05,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {13890#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13891#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:05,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {13891#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13892#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:05,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {13892#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13893#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:05,905 INFO L273 TraceCheckUtils]: 31: Hoare triple {13893#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13894#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:05,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {13894#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13895#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:05,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {13895#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13896#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:05,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {13896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13897#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:05,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {13897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13898#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:05,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {13898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13899#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:05,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {13899#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13900#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:05,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {13900#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13901#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:05,915 INFO L273 TraceCheckUtils]: 39: Hoare triple {13901#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13902#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:05,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {13902#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13903#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:05,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {13903#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13904#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:05,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {13904#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13905#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:05,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {13905#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13906#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:05,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {13906#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13907#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:05,921 INFO L273 TraceCheckUtils]: 45: Hoare triple {13907#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {13908#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {13908#(<= main_~i~0 41)} assume !(~i~0 < 100000); {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 47: Hoare triple {13867#false} havoc ~x~0;~x~0 := 1; {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 48: Hoare triple {13867#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L256 TraceCheckUtils]: 49: Hoare triple {13867#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 50: Hoare triple {13867#false} ~cond := #in~cond; {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 51: Hoare triple {13867#false} assume 0 == ~cond; {13867#false} is VALID [2018-11-23 12:08:05,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {13867#false} assume !false; {13867#false} is VALID [2018-11-23 12:08:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:05,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:05,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-23 12:08:05,945 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2018-11-23 12:08:05,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:05,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:08:05,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:08:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:08:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:08:05,987 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 43 states. [2018-11-23 12:08:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,395 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:08:06,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:08:06,395 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2018-11-23 12:08:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 12:08:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 12:08:06,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 72 transitions. [2018-11-23 12:08:06,474 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 12:08:06,475 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:08:06,476 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:08:06,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:08:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:08:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 12:08:06,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:06,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:06,509 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:06,509 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,510 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:08:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:08:06,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:06,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:06,510 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:06,511 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:08:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:06,511 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:08:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:08:06,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:06,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:06,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:06,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:08:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:08:06,513 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-23 12:08:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:06,513 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:08:06,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:08:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:08:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:08:06,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:06,513 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:06,514 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:06,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1403791470, now seen corresponding path program 41 times [2018-11-23 12:08:06,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:06,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:06,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:07,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {14415#true} call ULTIMATE.init(); {14415#true} is VALID [2018-11-23 12:08:07,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {14415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14415#true} is VALID [2018-11-23 12:08:07,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {14415#true} assume true; {14415#true} is VALID [2018-11-23 12:08:07,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14415#true} {14415#true} #48#return; {14415#true} is VALID [2018-11-23 12:08:07,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {14415#true} call #t~ret4 := main(); {14415#true} is VALID [2018-11-23 12:08:07,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {14415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {14417#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:07,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {14417#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14418#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:07,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {14418#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14419#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:07,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {14419#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14420#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:07,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {14420#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14421#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:07,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {14421#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14422#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:07,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {14422#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14423#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:07,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {14423#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14424#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:07,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {14424#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14425#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:07,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {14425#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14426#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:07,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {14426#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14427#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:07,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {14427#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14428#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:07,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {14428#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14429#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:07,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {14429#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14430#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:07,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14431#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:07,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {14431#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14432#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:07,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {14432#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14433#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:07,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {14433#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14434#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:07,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {14434#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14435#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:07,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {14435#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14436#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:07,435 INFO L273 TraceCheckUtils]: 25: Hoare triple {14436#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14437#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:07,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {14437#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14438#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:07,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {14438#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14439#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:07,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {14439#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14440#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:07,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {14440#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14441#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:07,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {14441#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14442#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:07,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {14442#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14443#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:07,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {14443#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14444#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:07,504 INFO L273 TraceCheckUtils]: 33: Hoare triple {14444#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14445#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:07,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {14445#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14446#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:07,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {14446#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14447#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:07,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {14447#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14448#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:07,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {14448#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14449#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:07,568 INFO L273 TraceCheckUtils]: 38: Hoare triple {14449#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14450#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:07,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {14450#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14451#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:07,588 INFO L273 TraceCheckUtils]: 40: Hoare triple {14451#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14452#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:07,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {14452#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14453#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:07,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {14453#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14454#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:07,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {14454#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14455#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:07,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {14455#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14456#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:07,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {14456#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14457#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:07,594 INFO L273 TraceCheckUtils]: 46: Hoare triple {14457#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14458#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:07,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {14458#(<= main_~i~0 42)} assume !(~i~0 < 100000); {14416#false} is VALID [2018-11-23 12:08:07,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {14416#false} havoc ~x~0;~x~0 := 1; {14416#false} is VALID [2018-11-23 12:08:07,595 INFO L273 TraceCheckUtils]: 49: Hoare triple {14416#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {14416#false} is VALID [2018-11-23 12:08:07,595 INFO L256 TraceCheckUtils]: 50: Hoare triple {14416#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {14416#false} is VALID [2018-11-23 12:08:07,595 INFO L273 TraceCheckUtils]: 51: Hoare triple {14416#false} ~cond := #in~cond; {14416#false} is VALID [2018-11-23 12:08:07,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {14416#false} assume 0 == ~cond; {14416#false} is VALID [2018-11-23 12:08:07,596 INFO L273 TraceCheckUtils]: 53: Hoare triple {14416#false} assume !false; {14416#false} is VALID [2018-11-23 12:08:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:07,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:07,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:16,234 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 12:08:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:16,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:16,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {14415#true} call ULTIMATE.init(); {14415#true} is VALID [2018-11-23 12:08:16,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {14415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14415#true} is VALID [2018-11-23 12:08:16,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {14415#true} assume true; {14415#true} is VALID [2018-11-23 12:08:16,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14415#true} {14415#true} #48#return; {14415#true} is VALID [2018-11-23 12:08:16,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {14415#true} call #t~ret4 := main(); {14415#true} is VALID [2018-11-23 12:08:16,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {14415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {14417#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:16,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {14417#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14418#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:16,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {14418#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14419#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:16,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {14419#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14420#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:16,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {14420#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14421#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:16,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {14421#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14422#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:16,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {14422#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14423#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:16,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {14423#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14424#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:16,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {14424#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14425#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:16,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {14425#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14426#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:16,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {14426#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14427#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:16,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {14427#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14428#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:16,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {14428#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14429#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:16,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {14429#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14430#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:16,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14431#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:16,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {14431#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14432#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:16,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {14432#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14433#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:16,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {14433#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14434#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:16,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {14434#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14435#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:16,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {14435#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14436#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:16,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {14436#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14437#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:16,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {14437#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14438#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:16,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {14438#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14439#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:16,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {14439#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14440#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:16,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {14440#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14441#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:16,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {14441#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14442#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:16,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {14442#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14443#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:16,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {14443#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14444#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:16,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {14444#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14445#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:16,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {14445#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14446#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:16,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {14446#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14447#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:16,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {14447#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14448#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:16,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {14448#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14449#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:16,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {14449#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14450#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:16,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {14450#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14451#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:16,507 INFO L273 TraceCheckUtils]: 40: Hoare triple {14451#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14452#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:16,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {14452#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14453#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:16,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {14453#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14454#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:16,510 INFO L273 TraceCheckUtils]: 43: Hoare triple {14454#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14455#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:16,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {14455#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14456#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:16,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {14456#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14457#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:16,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {14457#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14458#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:16,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {14458#(<= main_~i~0 42)} assume !(~i~0 < 100000); {14416#false} is VALID [2018-11-23 12:08:16,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {14416#false} havoc ~x~0;~x~0 := 1; {14416#false} is VALID [2018-11-23 12:08:16,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {14416#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {14416#false} is VALID [2018-11-23 12:08:16,514 INFO L256 TraceCheckUtils]: 50: Hoare triple {14416#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {14416#false} is VALID [2018-11-23 12:08:16,515 INFO L273 TraceCheckUtils]: 51: Hoare triple {14416#false} ~cond := #in~cond; {14416#false} is VALID [2018-11-23 12:08:16,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {14416#false} assume 0 == ~cond; {14416#false} is VALID [2018-11-23 12:08:16,515 INFO L273 TraceCheckUtils]: 53: Hoare triple {14416#false} assume !false; {14416#false} is VALID [2018-11-23 12:08:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:16,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:16,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-11-23 12:08:16,540 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-11-23 12:08:16,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:16,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:08:16,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:16,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:08:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:08:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:08:16,583 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 44 states. [2018-11-23 12:08:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,205 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 12:08:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:08:17,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-11-23 12:08:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:08:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 12:08:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:08:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 12:08:17,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 73 transitions. [2018-11-23 12:08:17,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:17,267 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:08:17,267 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:08:17,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:08:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:08:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 12:08:17,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:17,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 12:08:17,305 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:08:17,305 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:08:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,307 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 12:08:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:08:17,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:17,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:17,308 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:08:17,308 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:08:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:17,309 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 12:08:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:08:17,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:17,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:17,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:17,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:08:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 12:08:17,311 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-11-23 12:08:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:17,311 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 12:08:17,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:08:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:08:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:08:17,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:17,312 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:17,312 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:17,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1523216078, now seen corresponding path program 42 times [2018-11-23 12:08:17,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:17,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:19,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {14974#true} call ULTIMATE.init(); {14974#true} is VALID [2018-11-23 12:08:19,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {14974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14974#true} is VALID [2018-11-23 12:08:19,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {14974#true} assume true; {14974#true} is VALID [2018-11-23 12:08:19,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14974#true} {14974#true} #48#return; {14974#true} is VALID [2018-11-23 12:08:19,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {14974#true} call #t~ret4 := main(); {14974#true} is VALID [2018-11-23 12:08:19,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {14974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {14976#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:19,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {14976#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14977#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:19,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {14977#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14978#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:19,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {14978#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14979#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:19,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {14979#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14980#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:19,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {14980#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14981#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:19,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {14981#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14982#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:19,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {14982#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14983#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:19,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {14983#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14984#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:19,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {14984#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14985#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:19,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {14985#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14986#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:19,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {14986#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14987#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:19,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {14987#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14988#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:19,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {14988#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14989#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:19,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {14989#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14990#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:19,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {14990#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14991#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:19,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {14991#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14992#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:19,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {14992#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14993#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:19,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {14993#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14994#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:19,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {14994#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14995#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:19,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {14995#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14996#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:19,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {14996#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14997#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:19,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {14997#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14998#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:19,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {14998#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14999#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:19,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {14999#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15000#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:19,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {15000#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15001#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:19,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {15001#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15002#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:19,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {15002#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15003#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:19,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {15003#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15004#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:19,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {15004#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15005#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:19,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {15005#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15006#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:19,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {15006#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15007#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:19,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {15007#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15008#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:19,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {15008#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15009#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:19,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {15009#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15010#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:19,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {15010#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15011#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:19,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {15011#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15012#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:19,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {15012#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15013#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:19,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {15013#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15014#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:19,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {15014#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15015#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:19,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {15015#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15016#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:19,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {15016#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15017#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:19,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {15017#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:19,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {15018#(<= main_~i~0 43)} assume !(~i~0 < 100000); {14975#false} is VALID [2018-11-23 12:08:19,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {14975#false} havoc ~x~0;~x~0 := 1; {14975#false} is VALID [2018-11-23 12:08:19,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {14975#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {14975#false} is VALID [2018-11-23 12:08:19,173 INFO L256 TraceCheckUtils]: 51: Hoare triple {14975#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {14975#false} is VALID [2018-11-23 12:08:19,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {14975#false} ~cond := #in~cond; {14975#false} is VALID [2018-11-23 12:08:19,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {14975#false} assume 0 == ~cond; {14975#false} is VALID [2018-11-23 12:08:19,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {14975#false} assume !false; {14975#false} is VALID [2018-11-23 12:08:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:19,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:19,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:34,550 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-11-23 12:08:34,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:34,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:34,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {14974#true} call ULTIMATE.init(); {14974#true} is VALID [2018-11-23 12:08:34,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {14974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14974#true} is VALID [2018-11-23 12:08:34,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {14974#true} assume true; {14974#true} is VALID [2018-11-23 12:08:34,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14974#true} {14974#true} #48#return; {14974#true} is VALID [2018-11-23 12:08:34,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {14974#true} call #t~ret4 := main(); {14974#true} is VALID [2018-11-23 12:08:34,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {14974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {14976#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:34,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {14976#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14977#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:34,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {14977#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14978#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:34,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {14978#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14979#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:34,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {14979#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14980#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:34,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {14980#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14981#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:34,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {14981#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14982#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:34,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {14982#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14983#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:34,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {14983#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14984#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:34,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {14984#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14985#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:34,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {14985#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14986#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:34,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {14986#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14987#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:34,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {14987#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14988#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:34,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {14988#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14989#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:34,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {14989#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14990#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:34,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {14990#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14991#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:34,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {14991#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14992#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:34,825 INFO L273 TraceCheckUtils]: 22: Hoare triple {14992#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14993#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:34,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {14993#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14994#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:34,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {14994#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14995#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:34,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {14995#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14996#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:34,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {14996#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14997#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:34,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {14997#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14998#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:34,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {14998#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {14999#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:34,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {14999#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15000#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:34,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {15000#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15001#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:34,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {15001#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15002#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:34,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {15002#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15003#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:34,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {15003#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15004#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:34,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {15004#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15005#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:34,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {15005#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15006#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:34,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {15006#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15007#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:34,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {15007#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15008#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:34,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {15008#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15009#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:34,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {15009#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15010#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:34,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {15010#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15011#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:34,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {15011#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15012#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:34,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {15012#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15013#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:34,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {15013#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15014#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:34,848 INFO L273 TraceCheckUtils]: 44: Hoare triple {15014#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15015#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:34,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {15015#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15016#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:34,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {15016#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15017#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:34,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {15017#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:34,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {15018#(<= main_~i~0 43)} assume !(~i~0 < 100000); {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L273 TraceCheckUtils]: 49: Hoare triple {14975#false} havoc ~x~0;~x~0 := 1; {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {14975#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L256 TraceCheckUtils]: 51: Hoare triple {14975#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {14975#false} ~cond := #in~cond; {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {14975#false} assume 0 == ~cond; {14975#false} is VALID [2018-11-23 12:08:34,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {14975#false} assume !false; {14975#false} is VALID [2018-11-23 12:08:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:34,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:34,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-11-23 12:08:34,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2018-11-23 12:08:34,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:34,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:08:35,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:08:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:08:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:08:35,080 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 45 states. [2018-11-23 12:08:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,752 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:08:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:08:35,753 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2018-11-23 12:08:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:08:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 12:08:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:08:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 12:08:35,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 74 transitions. [2018-11-23 12:08:35,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:35,833 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:08:35,833 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:08:35,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:08:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:08:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:08:35,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:35,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:08:35,881 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:08:35,881 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:08:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,883 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:08:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:08:35,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:35,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:35,883 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:08:35,884 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:08:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:35,885 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:08:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:08:35,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:35,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:35,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:35,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:08:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 12:08:35,886 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-11-23 12:08:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:35,887 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 12:08:35,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:08:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:08:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:08:35,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:35,888 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:35,888 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:35,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2066136850, now seen corresponding path program 43 times [2018-11-23 12:08:35,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:35,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:37,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {15543#true} call ULTIMATE.init(); {15543#true} is VALID [2018-11-23 12:08:37,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {15543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15543#true} is VALID [2018-11-23 12:08:37,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {15543#true} assume true; {15543#true} is VALID [2018-11-23 12:08:37,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15543#true} {15543#true} #48#return; {15543#true} is VALID [2018-11-23 12:08:37,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {15543#true} call #t~ret4 := main(); {15543#true} is VALID [2018-11-23 12:08:37,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {15543#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {15545#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:37,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {15545#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15546#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:37,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {15546#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15547#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:37,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {15547#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15548#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:37,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {15548#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15549#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:37,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {15549#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15550#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:37,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {15550#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15551#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:37,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {15551#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15552#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:37,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {15552#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15553#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:37,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {15553#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15554#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:37,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {15554#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15555#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:37,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {15555#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15556#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:37,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {15556#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15557#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:37,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {15557#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15558#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:37,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {15558#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15559#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:37,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {15559#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15560#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:37,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {15560#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15561#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:37,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {15561#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15562#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:37,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {15562#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15563#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:37,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {15563#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15564#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:37,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {15564#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15565#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:37,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {15565#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15566#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:37,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {15566#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15567#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:37,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {15567#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15568#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:37,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {15568#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15569#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:37,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {15569#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15570#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:37,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {15570#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15571#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:37,325 INFO L273 TraceCheckUtils]: 32: Hoare triple {15571#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15572#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:37,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {15572#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15573#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:37,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {15573#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15574#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:37,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {15574#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15575#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:37,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {15575#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15576#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:37,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {15576#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15577#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:37,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {15577#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15578#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:37,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {15578#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15579#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:37,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {15579#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15580#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:37,334 INFO L273 TraceCheckUtils]: 41: Hoare triple {15580#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15581#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:37,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {15581#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15582#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:37,336 INFO L273 TraceCheckUtils]: 43: Hoare triple {15582#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15583#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:37,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {15583#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15584#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:37,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {15584#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15585#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:37,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {15585#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15586#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:37,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {15586#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15587#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:37,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {15587#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15588#(<= main_~i~0 44)} is VALID [2018-11-23 12:08:37,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {15588#(<= main_~i~0 44)} assume !(~i~0 < 100000); {15544#false} is VALID [2018-11-23 12:08:37,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {15544#false} havoc ~x~0;~x~0 := 1; {15544#false} is VALID [2018-11-23 12:08:37,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {15544#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {15544#false} is VALID [2018-11-23 12:08:37,342 INFO L256 TraceCheckUtils]: 52: Hoare triple {15544#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {15544#false} is VALID [2018-11-23 12:08:37,342 INFO L273 TraceCheckUtils]: 53: Hoare triple {15544#false} ~cond := #in~cond; {15544#false} is VALID [2018-11-23 12:08:37,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {15544#false} assume 0 == ~cond; {15544#false} is VALID [2018-11-23 12:08:37,343 INFO L273 TraceCheckUtils]: 55: Hoare triple {15544#false} assume !false; {15544#false} is VALID [2018-11-23 12:08:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:37,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:37,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:37,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:37,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {15543#true} call ULTIMATE.init(); {15543#true} is VALID [2018-11-23 12:08:37,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {15543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15543#true} is VALID [2018-11-23 12:08:37,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {15543#true} assume true; {15543#true} is VALID [2018-11-23 12:08:37,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15543#true} {15543#true} #48#return; {15543#true} is VALID [2018-11-23 12:08:37,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {15543#true} call #t~ret4 := main(); {15543#true} is VALID [2018-11-23 12:08:37,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {15543#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {15545#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:37,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {15545#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15546#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:37,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {15546#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15547#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:37,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {15547#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15548#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:37,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {15548#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15549#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:37,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {15549#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15550#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:37,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {15550#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15551#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:37,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {15551#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15552#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:37,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {15552#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15553#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:37,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {15553#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15554#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:37,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {15554#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15555#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:37,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {15555#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15556#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:37,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {15556#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15557#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:37,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {15557#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15558#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:37,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {15558#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15559#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:37,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {15559#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15560#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:37,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {15560#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15561#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:37,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {15561#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15562#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:37,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {15562#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15563#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:37,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {15563#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15564#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:37,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {15564#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15565#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:37,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {15565#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15566#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:37,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {15566#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15567#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:37,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {15567#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15568#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:37,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {15568#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15569#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:37,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {15569#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15570#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:37,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {15570#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15571#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:37,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {15571#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15572#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:37,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {15572#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15573#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:37,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {15573#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15574#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:37,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {15574#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15575#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:37,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {15575#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15576#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:37,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {15576#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15577#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:37,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {15577#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15578#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:37,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {15578#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15579#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:37,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {15579#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15580#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:37,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {15580#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15581#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:37,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {15581#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15582#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:37,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {15582#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15583#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:37,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {15583#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15584#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:37,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {15584#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15585#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:37,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {15585#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15586#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:37,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {15586#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15587#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:37,792 INFO L273 TraceCheckUtils]: 48: Hoare triple {15587#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {15588#(<= main_~i~0 44)} is VALID [2018-11-23 12:08:37,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {15588#(<= main_~i~0 44)} assume !(~i~0 < 100000); {15544#false} is VALID [2018-11-23 12:08:37,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {15544#false} havoc ~x~0;~x~0 := 1; {15544#false} is VALID [2018-11-23 12:08:37,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {15544#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {15544#false} is VALID [2018-11-23 12:08:37,793 INFO L256 TraceCheckUtils]: 52: Hoare triple {15544#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {15544#false} is VALID [2018-11-23 12:08:37,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {15544#false} ~cond := #in~cond; {15544#false} is VALID [2018-11-23 12:08:37,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {15544#false} assume 0 == ~cond; {15544#false} is VALID [2018-11-23 12:08:37,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {15544#false} assume !false; {15544#false} is VALID [2018-11-23 12:08:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:37,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:37,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-11-23 12:08:37,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-11-23 12:08:37,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:37,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:08:37,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:37,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:08:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:08:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:08:37,855 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 46 states. [2018-11-23 12:08:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,407 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 12:08:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:08:38,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-11-23 12:08:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:08:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 12:08:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:08:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 12:08:38,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 75 transitions. [2018-11-23 12:08:38,465 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 12:08:38,466 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:08:38,466 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:08:38,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:08:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:08:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 12:08:38,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:38,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 12:08:38,509 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:08:38,509 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:08:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,510 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 12:08:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:08:38,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,511 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:08:38,511 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:08:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,512 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 12:08:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:08:38,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:38,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:08:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 12:08:38,513 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2018-11-23 12:08:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:38,513 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 12:08:38,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:08:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:08:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:08:38,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:38,514 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:38,514 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:38,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1716811598, now seen corresponding path program 44 times [2018-11-23 12:08:38,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:39,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {16122#true} call ULTIMATE.init(); {16122#true} is VALID [2018-11-23 12:08:39,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {16122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16122#true} is VALID [2018-11-23 12:08:39,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {16122#true} assume true; {16122#true} is VALID [2018-11-23 12:08:39,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16122#true} {16122#true} #48#return; {16122#true} is VALID [2018-11-23 12:08:39,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {16122#true} call #t~ret4 := main(); {16122#true} is VALID [2018-11-23 12:08:39,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {16122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {16124#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:39,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {16124#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16125#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:39,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {16125#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16126#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:39,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {16126#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16127#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:39,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {16127#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16128#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:39,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {16128#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16129#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:39,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {16129#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16130#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:39,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {16130#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16131#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:39,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {16131#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16132#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:39,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {16132#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16133#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:39,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {16133#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16134#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:39,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {16134#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16135#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:39,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {16135#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16136#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:39,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {16136#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16137#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:39,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {16137#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16138#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:39,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {16138#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16139#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:39,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {16139#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16140#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:39,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {16140#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16141#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:39,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {16141#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16142#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:39,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {16142#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16143#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:39,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {16143#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16144#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:39,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {16144#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16145#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:39,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {16145#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16146#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:39,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {16146#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16147#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:39,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {16147#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16148#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:39,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {16148#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16149#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:39,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {16149#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16150#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:39,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {16150#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16151#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:39,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {16151#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16152#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:39,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {16152#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16153#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:39,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {16153#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16154#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:39,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {16154#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16155#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:39,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {16155#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16156#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:39,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {16156#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16157#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:39,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {16157#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16158#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:39,700 INFO L273 TraceCheckUtils]: 40: Hoare triple {16158#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16159#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:39,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {16159#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16160#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:39,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {16160#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16161#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:39,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {16161#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16162#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:39,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {16162#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16163#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:39,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {16163#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16164#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:39,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {16164#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16165#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:39,707 INFO L273 TraceCheckUtils]: 47: Hoare triple {16165#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16166#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:39,708 INFO L273 TraceCheckUtils]: 48: Hoare triple {16166#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16167#(<= main_~i~0 44)} is VALID [2018-11-23 12:08:39,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {16167#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16168#(<= main_~i~0 45)} is VALID [2018-11-23 12:08:39,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {16168#(<= main_~i~0 45)} assume !(~i~0 < 100000); {16123#false} is VALID [2018-11-23 12:08:39,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {16123#false} havoc ~x~0;~x~0 := 1; {16123#false} is VALID [2018-11-23 12:08:39,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {16123#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {16123#false} is VALID [2018-11-23 12:08:39,710 INFO L256 TraceCheckUtils]: 53: Hoare triple {16123#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {16123#false} is VALID [2018-11-23 12:08:39,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {16123#false} ~cond := #in~cond; {16123#false} is VALID [2018-11-23 12:08:39,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {16123#false} assume 0 == ~cond; {16123#false} is VALID [2018-11-23 12:08:39,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {16123#false} assume !false; {16123#false} is VALID [2018-11-23 12:08:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:39,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:39,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:39,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:39,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:39,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:40,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {16122#true} call ULTIMATE.init(); {16122#true} is VALID [2018-11-23 12:08:40,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {16122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16122#true} is VALID [2018-11-23 12:08:40,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {16122#true} assume true; {16122#true} is VALID [2018-11-23 12:08:40,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16122#true} {16122#true} #48#return; {16122#true} is VALID [2018-11-23 12:08:40,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {16122#true} call #t~ret4 := main(); {16122#true} is VALID [2018-11-23 12:08:40,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {16122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {16124#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:40,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {16124#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16125#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:40,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {16125#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16126#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:40,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {16126#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16127#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:40,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {16127#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16128#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:40,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {16128#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16129#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:40,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {16129#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16130#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:40,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {16130#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16131#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:40,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {16131#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16132#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:40,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {16132#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16133#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:40,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {16133#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16134#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:40,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {16134#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16135#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:40,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {16135#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16136#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:40,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {16136#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16137#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:40,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {16137#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16138#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:40,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {16138#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16139#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:40,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {16139#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16140#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:40,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {16140#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16141#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:40,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {16141#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16142#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:40,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {16142#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16143#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:40,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {16143#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16144#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:40,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {16144#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16145#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:40,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {16145#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16146#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:40,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {16146#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16147#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:40,101 INFO L273 TraceCheckUtils]: 29: Hoare triple {16147#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16148#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:40,102 INFO L273 TraceCheckUtils]: 30: Hoare triple {16148#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16149#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:40,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {16149#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16150#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:40,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {16150#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16151#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:40,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {16151#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16152#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:40,106 INFO L273 TraceCheckUtils]: 34: Hoare triple {16152#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16153#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:40,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {16153#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16154#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:40,108 INFO L273 TraceCheckUtils]: 36: Hoare triple {16154#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16155#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:40,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {16155#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16156#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:40,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {16156#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16157#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:40,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {16157#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16158#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:40,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {16158#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16159#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:40,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {16159#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16160#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:40,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {16160#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16161#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:40,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {16161#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16162#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:40,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {16162#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16163#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:40,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {16163#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16164#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:40,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {16164#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16165#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:40,119 INFO L273 TraceCheckUtils]: 47: Hoare triple {16165#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16166#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:40,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {16166#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16167#(<= main_~i~0 44)} is VALID [2018-11-23 12:08:40,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {16167#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16168#(<= main_~i~0 45)} is VALID [2018-11-23 12:08:40,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {16168#(<= main_~i~0 45)} assume !(~i~0 < 100000); {16123#false} is VALID [2018-11-23 12:08:40,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {16123#false} havoc ~x~0;~x~0 := 1; {16123#false} is VALID [2018-11-23 12:08:40,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {16123#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {16123#false} is VALID [2018-11-23 12:08:40,123 INFO L256 TraceCheckUtils]: 53: Hoare triple {16123#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {16123#false} is VALID [2018-11-23 12:08:40,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {16123#false} ~cond := #in~cond; {16123#false} is VALID [2018-11-23 12:08:40,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {16123#false} assume 0 == ~cond; {16123#false} is VALID [2018-11-23 12:08:40,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {16123#false} assume !false; {16123#false} is VALID [2018-11-23 12:08:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:40,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:40,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-11-23 12:08:40,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2018-11-23 12:08:40,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:40,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:08:40,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:40,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:08:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:08:40,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:08:40,501 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 47 states. [2018-11-23 12:08:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:41,969 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 12:08:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:08:41,969 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2018-11-23 12:08:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:08:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 12:08:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:08:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 12:08:41,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 76 transitions. [2018-11-23 12:08:42,079 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 12:08:42,080 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:08:42,080 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:08:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:08:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:08:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 12:08:42,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:42,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-23 12:08:42,125 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 12:08:42,125 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 12:08:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,126 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:08:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:08:42,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:42,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:42,127 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 12:08:42,127 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 12:08:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,128 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:08:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:08:42,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:42,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:42,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:42,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:08:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 12:08:42,130 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2018-11-23 12:08:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:42,130 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 12:08:42,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:08:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:08:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:08:42,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:42,131 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:42,131 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:42,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 522336622, now seen corresponding path program 45 times [2018-11-23 12:08:42,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:42,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:43,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {16711#true} call ULTIMATE.init(); {16711#true} is VALID [2018-11-23 12:08:43,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {16711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16711#true} is VALID [2018-11-23 12:08:43,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {16711#true} assume true; {16711#true} is VALID [2018-11-23 12:08:43,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16711#true} {16711#true} #48#return; {16711#true} is VALID [2018-11-23 12:08:43,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {16711#true} call #t~ret4 := main(); {16711#true} is VALID [2018-11-23 12:08:43,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {16711#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {16713#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:43,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {16713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16714#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:43,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {16714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16715#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:43,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {16715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16716#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:43,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {16716#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16717#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:43,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {16717#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16718#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:43,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {16718#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16719#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:43,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {16719#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16720#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:43,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {16720#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16721#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:43,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {16721#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16722#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:43,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {16722#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16723#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:43,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {16723#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16724#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:43,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {16724#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16725#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:43,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {16725#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16726#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:43,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {16726#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16727#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:43,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {16727#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16728#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:43,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {16728#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16729#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:43,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {16729#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16730#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:43,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {16730#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16731#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:43,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {16731#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16732#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:43,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {16732#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16733#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:43,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {16733#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16734#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:43,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {16734#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16735#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:43,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {16735#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16736#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:43,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {16736#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16737#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:43,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {16737#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16738#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:43,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {16738#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16739#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:43,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {16739#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16740#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:43,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {16740#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16741#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:43,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {16741#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16742#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:43,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {16742#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16743#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:43,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {16743#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16744#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:43,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {16744#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16745#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:43,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {16745#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16746#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:43,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {16746#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16747#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:43,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {16747#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16748#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:43,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {16748#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16749#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:43,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {16749#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16750#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:43,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {16750#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16751#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:43,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {16751#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16752#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:43,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {16752#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16753#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:43,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {16753#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16754#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:43,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {16754#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16755#(<= main_~i~0 43)} is VALID [2018-11-23 12:08:43,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {16755#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16756#(<= main_~i~0 44)} is VALID [2018-11-23 12:08:43,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {16756#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16757#(<= main_~i~0 45)} is VALID [2018-11-23 12:08:43,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {16757#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16758#(<= main_~i~0 46)} is VALID [2018-11-23 12:08:43,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {16758#(<= main_~i~0 46)} assume !(~i~0 < 100000); {16712#false} is VALID [2018-11-23 12:08:43,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {16712#false} havoc ~x~0;~x~0 := 1; {16712#false} is VALID [2018-11-23 12:08:43,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {16712#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {16712#false} is VALID [2018-11-23 12:08:43,255 INFO L256 TraceCheckUtils]: 54: Hoare triple {16712#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {16712#false} is VALID [2018-11-23 12:08:43,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {16712#false} ~cond := #in~cond; {16712#false} is VALID [2018-11-23 12:08:43,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {16712#false} assume 0 == ~cond; {16712#false} is VALID [2018-11-23 12:08:43,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {16712#false} assume !false; {16712#false} is VALID [2018-11-23 12:08:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:43,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:43,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:43,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:13,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-23 12:09:13,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:13,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:13,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {16711#true} call ULTIMATE.init(); {16711#true} is VALID [2018-11-23 12:09:13,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {16711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16711#true} is VALID [2018-11-23 12:09:13,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {16711#true} assume true; {16711#true} is VALID [2018-11-23 12:09:13,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16711#true} {16711#true} #48#return; {16711#true} is VALID [2018-11-23 12:09:13,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {16711#true} call #t~ret4 := main(); {16711#true} is VALID [2018-11-23 12:09:13,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {16711#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {16713#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:13,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {16713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16714#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:13,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {16714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16715#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:13,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {16715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16716#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:13,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {16716#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16717#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:13,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {16717#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16718#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:13,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {16718#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16719#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:13,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {16719#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16720#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:13,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {16720#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16721#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:13,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {16721#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16722#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:13,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {16722#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16723#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:13,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {16723#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16724#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:13,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {16724#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16725#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:13,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {16725#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16726#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:13,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {16726#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16727#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:13,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {16727#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16728#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:13,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {16728#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16729#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:13,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {16729#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16730#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:13,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {16730#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16731#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:13,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {16731#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16732#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:13,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {16732#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16733#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:13,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {16733#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16734#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:13,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {16734#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16735#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:13,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {16735#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16736#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:13,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {16736#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16737#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:13,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {16737#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16738#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:13,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {16738#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16739#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:13,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {16739#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16740#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:13,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {16740#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16741#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:13,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {16741#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16742#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:13,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {16742#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16743#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:13,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {16743#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16744#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:13,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {16744#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16745#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:13,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {16745#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16746#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:13,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {16746#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16747#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:13,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {16747#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16748#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:13,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {16748#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16749#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:13,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {16749#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16750#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:13,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {16750#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16751#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:13,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {16751#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16752#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:13,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {16752#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16753#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:13,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {16753#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16754#(<= main_~i~0 42)} is VALID [2018-11-23 12:09:13,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {16754#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16755#(<= main_~i~0 43)} is VALID [2018-11-23 12:09:13,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {16755#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16756#(<= main_~i~0 44)} is VALID [2018-11-23 12:09:13,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {16756#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16757#(<= main_~i~0 45)} is VALID [2018-11-23 12:09:13,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {16757#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {16758#(<= main_~i~0 46)} is VALID [2018-11-23 12:09:13,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {16758#(<= main_~i~0 46)} assume !(~i~0 < 100000); {16712#false} is VALID [2018-11-23 12:09:13,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {16712#false} havoc ~x~0;~x~0 := 1; {16712#false} is VALID [2018-11-23 12:09:13,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {16712#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {16712#false} is VALID [2018-11-23 12:09:13,421 INFO L256 TraceCheckUtils]: 54: Hoare triple {16712#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {16712#false} is VALID [2018-11-23 12:09:13,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {16712#false} ~cond := #in~cond; {16712#false} is VALID [2018-11-23 12:09:13,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {16712#false} assume 0 == ~cond; {16712#false} is VALID [2018-11-23 12:09:13,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {16712#false} assume !false; {16712#false} is VALID [2018-11-23 12:09:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:13,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-11-23 12:09:13,449 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2018-11-23 12:09:13,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:13,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:09:13,492 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 12:09:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:09:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:09:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:09:13,493 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 48 states. [2018-11-23 12:09:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:14,186 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 12:09:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:09:14,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2018-11-23 12:09:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:09:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-23 12:09:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:09:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-23 12:09:14,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 77 transitions. [2018-11-23 12:09:14,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:14,247 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:09:14,247 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:09:14,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:09:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:09:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:09:14,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:14,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:09:14,286 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:09:14,286 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:09:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:14,288 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 12:09:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 12:09:14,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:14,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:14,288 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:09:14,289 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:09:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:14,290 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 12:09:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 12:09:14,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:14,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:14,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:14,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:09:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 12:09:14,291 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2018-11-23 12:09:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:14,292 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 12:09:14,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:09:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 12:09:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:09:14,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:14,293 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:14,293 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:14,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 46 times [2018-11-23 12:09:14,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:14,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:14,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:15,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {17310#true} call ULTIMATE.init(); {17310#true} is VALID [2018-11-23 12:09:15,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {17310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17310#true} is VALID [2018-11-23 12:09:15,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {17310#true} assume true; {17310#true} is VALID [2018-11-23 12:09:15,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17310#true} {17310#true} #48#return; {17310#true} is VALID [2018-11-23 12:09:15,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {17310#true} call #t~ret4 := main(); {17310#true} is VALID [2018-11-23 12:09:15,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {17310#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {17312#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:15,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {17312#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17313#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:15,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {17313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17314#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:15,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {17314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17315#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:15,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {17315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17316#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:15,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {17316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17317#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:15,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {17317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17318#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:15,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {17318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17319#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:15,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {17319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17320#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:15,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {17320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17321#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:15,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {17321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17322#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:15,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {17322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17323#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:15,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {17323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17324#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:15,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {17324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17325#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:15,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {17325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17326#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:15,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {17326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17327#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:15,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {17327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17328#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:15,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {17328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17329#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:15,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {17329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17330#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:15,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {17330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17331#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:15,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {17331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17332#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:15,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {17332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17333#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:15,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {17333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17334#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:15,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {17334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17335#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:15,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {17335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17336#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:15,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {17336#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17337#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:15,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {17337#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17338#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:15,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {17338#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17339#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:15,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {17339#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17340#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:15,790 INFO L273 TraceCheckUtils]: 34: Hoare triple {17340#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17341#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:15,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {17341#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17342#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:15,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {17342#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17343#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:15,795 INFO L273 TraceCheckUtils]: 37: Hoare triple {17343#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17344#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:15,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {17344#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17345#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:15,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {17345#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17346#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:15,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {17346#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17347#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:15,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {17347#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17348#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:15,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {17348#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17349#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:15,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {17349#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17350#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:15,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {17350#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17351#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:15,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {17351#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17352#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:15,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {17352#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17353#(<= main_~i~0 42)} is VALID [2018-11-23 12:09:15,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {17353#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17354#(<= main_~i~0 43)} is VALID [2018-11-23 12:09:15,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {17354#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17355#(<= main_~i~0 44)} is VALID [2018-11-23 12:09:15,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {17355#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17356#(<= main_~i~0 45)} is VALID [2018-11-23 12:09:15,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {17356#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17357#(<= main_~i~0 46)} is VALID [2018-11-23 12:09:15,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {17357#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17358#(<= main_~i~0 47)} is VALID [2018-11-23 12:09:15,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {17358#(<= main_~i~0 47)} assume !(~i~0 < 100000); {17311#false} is VALID [2018-11-23 12:09:15,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {17311#false} havoc ~x~0;~x~0 := 1; {17311#false} is VALID [2018-11-23 12:09:15,810 INFO L273 TraceCheckUtils]: 54: Hoare triple {17311#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {17311#false} is VALID [2018-11-23 12:09:15,810 INFO L256 TraceCheckUtils]: 55: Hoare triple {17311#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {17311#false} is VALID [2018-11-23 12:09:15,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {17311#false} ~cond := #in~cond; {17311#false} is VALID [2018-11-23 12:09:15,811 INFO L273 TraceCheckUtils]: 57: Hoare triple {17311#false} assume 0 == ~cond; {17311#false} is VALID [2018-11-23 12:09:15,811 INFO L273 TraceCheckUtils]: 58: Hoare triple {17311#false} assume !false; {17311#false} is VALID [2018-11-23 12:09:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:15,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:15,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:15,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:15,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:15,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:16,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {17310#true} call ULTIMATE.init(); {17310#true} is VALID [2018-11-23 12:09:16,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {17310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17310#true} is VALID [2018-11-23 12:09:16,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {17310#true} assume true; {17310#true} is VALID [2018-11-23 12:09:16,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17310#true} {17310#true} #48#return; {17310#true} is VALID [2018-11-23 12:09:16,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {17310#true} call #t~ret4 := main(); {17310#true} is VALID [2018-11-23 12:09:16,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {17310#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {17312#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:16,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {17312#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17313#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:16,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {17313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17314#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:16,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {17314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17315#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:16,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {17315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17316#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:16,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {17316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17317#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:16,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {17317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17318#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:16,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {17318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17319#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:16,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {17319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17320#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:16,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {17320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17321#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:16,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {17321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17322#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:16,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {17322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17323#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:16,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {17323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17324#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:16,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {17324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17325#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:16,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {17325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17326#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:16,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {17326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17327#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:16,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {17327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17328#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:16,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {17328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17329#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:16,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {17329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17330#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:16,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {17330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17331#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:16,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {17331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17332#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:16,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {17332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17333#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:16,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {17333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17334#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:16,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {17334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17335#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:16,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {17335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17336#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:16,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {17336#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17337#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:16,903 INFO L273 TraceCheckUtils]: 31: Hoare triple {17337#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17338#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:16,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {17338#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17339#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:16,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {17339#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17340#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:16,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {17340#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17341#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:16,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {17341#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17342#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:16,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {17342#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17343#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:16,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {17343#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17344#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:16,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {17344#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17345#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:16,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {17345#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17346#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:16,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {17346#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17347#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:16,913 INFO L273 TraceCheckUtils]: 41: Hoare triple {17347#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17348#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:16,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {17348#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17349#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:16,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {17349#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17350#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:16,917 INFO L273 TraceCheckUtils]: 44: Hoare triple {17350#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17351#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:16,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {17351#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17352#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:16,919 INFO L273 TraceCheckUtils]: 46: Hoare triple {17352#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17353#(<= main_~i~0 42)} is VALID [2018-11-23 12:09:16,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {17353#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17354#(<= main_~i~0 43)} is VALID [2018-11-23 12:09:16,921 INFO L273 TraceCheckUtils]: 48: Hoare triple {17354#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17355#(<= main_~i~0 44)} is VALID [2018-11-23 12:09:16,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {17355#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17356#(<= main_~i~0 45)} is VALID [2018-11-23 12:09:16,923 INFO L273 TraceCheckUtils]: 50: Hoare triple {17356#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17357#(<= main_~i~0 46)} is VALID [2018-11-23 12:09:16,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {17357#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17358#(<= main_~i~0 47)} is VALID [2018-11-23 12:09:16,924 INFO L273 TraceCheckUtils]: 52: Hoare triple {17358#(<= main_~i~0 47)} assume !(~i~0 < 100000); {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {17311#false} havoc ~x~0;~x~0 := 1; {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {17311#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L256 TraceCheckUtils]: 55: Hoare triple {17311#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {17311#false} ~cond := #in~cond; {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {17311#false} assume 0 == ~cond; {17311#false} is VALID [2018-11-23 12:09:16,925 INFO L273 TraceCheckUtils]: 58: Hoare triple {17311#false} assume !false; {17311#false} is VALID [2018-11-23 12:09:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:16,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:16,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-11-23 12:09:16,950 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 59 [2018-11-23 12:09:16,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:16,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:09:16,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:16,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:09:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:09:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:09:16,993 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 49 states. [2018-11-23 12:09:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:17,473 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:09:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:09:17,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 59 [2018-11-23 12:09:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:09:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2018-11-23 12:09:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:09:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2018-11-23 12:09:17,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 78 transitions. [2018-11-23 12:09:17,604 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 12:09:17,605 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:09:17,605 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:09:17,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:09:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:09:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 12:09:17,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:17,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-23 12:09:17,651 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 12:09:17,651 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 12:09:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:17,652 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-11-23 12:09:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-23 12:09:17,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:17,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:17,652 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 12:09:17,653 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 12:09:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:17,654 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-11-23 12:09:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-23 12:09:17,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:17,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:17,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:17,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:09:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-23 12:09:17,656 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-11-23 12:09:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:17,656 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-23 12:09:17,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:09:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-23 12:09:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:09:17,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:17,657 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:17,657 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:17,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1259278830, now seen corresponding path program 47 times [2018-11-23 12:09:17,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:17,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:17,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:18,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {17919#true} call ULTIMATE.init(); {17919#true} is VALID [2018-11-23 12:09:18,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {17919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17919#true} is VALID [2018-11-23 12:09:18,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {17919#true} assume true; {17919#true} is VALID [2018-11-23 12:09:18,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17919#true} {17919#true} #48#return; {17919#true} is VALID [2018-11-23 12:09:18,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {17919#true} call #t~ret4 := main(); {17919#true} is VALID [2018-11-23 12:09:18,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {17919#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~i~0 := 1;call write~int(7, ~#a~0.base, ~#a~0.offset, 4); {17921#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:18,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {17921#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17922#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:18,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {17922#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17923#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:18,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {17923#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17924#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:18,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {17924#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17925#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:18,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {17925#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17926#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:18,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {17926#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17927#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:18,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {17927#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17928#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:18,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {17928#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17929#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:18,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {17929#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17930#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:18,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {17930#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17931#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:18,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {17931#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17932#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:18,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {17932#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17933#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:18,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {17933#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17934#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:18,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {17934#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17935#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:18,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {17935#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17936#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:18,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {17936#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17937#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:18,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {17937#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17938#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:18,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {17938#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17939#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:18,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {17939#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17940#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:18,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {17940#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17941#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:18,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {17941#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17942#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:18,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {17942#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17943#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:18,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {17943#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17944#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:18,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {17944#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17945#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:18,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {17945#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17946#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:18,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {17946#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17947#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:18,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {17947#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17948#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:18,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {17948#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17949#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:18,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {17949#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17950#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:18,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {17950#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17951#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:18,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {17951#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17952#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:18,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {17952#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17953#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:18,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {17953#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17954#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:18,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {17954#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17955#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:18,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {17955#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17956#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:18,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {17956#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17957#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:18,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {17957#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17958#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:18,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {17958#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17959#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:18,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {17959#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17960#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:18,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {17960#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17961#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:18,839 INFO L273 TraceCheckUtils]: 46: Hoare triple {17961#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17962#(<= main_~i~0 42)} is VALID [2018-11-23 12:09:18,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {17962#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17963#(<= main_~i~0 43)} is VALID [2018-11-23 12:09:18,841 INFO L273 TraceCheckUtils]: 48: Hoare triple {17963#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17964#(<= main_~i~0 44)} is VALID [2018-11-23 12:09:18,842 INFO L273 TraceCheckUtils]: 49: Hoare triple {17964#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17965#(<= main_~i~0 45)} is VALID [2018-11-23 12:09:18,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {17965#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17966#(<= main_~i~0 46)} is VALID [2018-11-23 12:09:18,844 INFO L273 TraceCheckUtils]: 51: Hoare triple {17966#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17967#(<= main_~i~0 47)} is VALID [2018-11-23 12:09:18,845 INFO L273 TraceCheckUtils]: 52: Hoare triple {17967#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~i~0 - 1), 4);call write~int(1 + #t~mem0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);havoc #t~mem0;~i~0 := 1 + ~i~0; {17968#(<= main_~i~0 48)} is VALID [2018-11-23 12:09:18,846 INFO L273 TraceCheckUtils]: 53: Hoare triple {17968#(<= main_~i~0 48)} assume !(~i~0 < 100000); {17920#false} is VALID [2018-11-23 12:09:18,846 INFO L273 TraceCheckUtils]: 54: Hoare triple {17920#false} havoc ~x~0;~x~0 := 1; {17920#false} is VALID [2018-11-23 12:09:18,846 INFO L273 TraceCheckUtils]: 55: Hoare triple {17920#false} assume !!(~x~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (~x~0 - 1), 4); {17920#false} is VALID [2018-11-23 12:09:18,847 INFO L256 TraceCheckUtils]: 56: Hoare triple {17920#false} call __VERIFIER_assert((if #t~mem2 >= #t~mem3 then 1 else 0)); {17920#false} is VALID [2018-11-23 12:09:18,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {17920#false} ~cond := #in~cond; {17920#false} is VALID [2018-11-23 12:09:18,847 INFO L273 TraceCheckUtils]: 58: Hoare triple {17920#false} assume 0 == ~cond; {17920#false} is VALID [2018-11-23 12:09:18,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {17920#false} assume !false; {17920#false} is VALID [2018-11-23 12:09:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:18,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:18,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:18,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1