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_init8_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:22,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:22,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:22,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:22,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:22,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:22,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:22,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:22,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:22,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:22,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:22,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:22,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:22,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:22,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:22,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:22,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:22,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:22,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:22,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:22,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:22,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:22,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:22,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:22,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:22,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:22,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:22,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:22,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:22,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:22,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:22,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:22,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:22,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:22,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:22,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:22,283 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:22,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:22,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:22,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:22,305 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:22,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:22,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:22,306 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:22,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:22,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:22,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:22,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:22,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:22,307 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:22,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:22,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:22,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:22,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:22,308 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:22,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:22,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:22,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:22,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:22,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:22,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:22,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:22,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:22,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:22,311 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:22,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:22,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:22,311 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:22,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:22,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:22,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:22,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:22,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:22,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init8_false-unreach-call_ground.i [2018-11-23 11:55:22,441 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5968c30/dbe8be456fdb472cbfc12b249926efaa/FLAGd6f30fdeb [2018-11-23 11:55:22,944 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:22,945 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init8_false-unreach-call_ground.i [2018-11-23 11:55:22,952 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5968c30/dbe8be456fdb472cbfc12b249926efaa/FLAGd6f30fdeb [2018-11-23 11:55:23,279 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5968c30/dbe8be456fdb472cbfc12b249926efaa [2018-11-23 11:55:23,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:23,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:23,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:23,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:23,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:23,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cdc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23, skipping insertion in model container [2018-11-23 11:55:23,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:23,335 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:23,562 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:23,569 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:23,613 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:23,637 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:23,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23 WrapperNode [2018-11-23 11:55:23,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:23,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:23,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:23,639 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:23,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:23,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:23,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:23,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:23,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:23,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:23,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:23,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:23,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:23,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:24,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:24,738 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 11:55:24,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:24 BoogieIcfgContainer [2018-11-23 11:55:24,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:24,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:24,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:24,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:24,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:23" (1/3) ... [2018-11-23 11:55:24,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317ef78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:24, skipping insertion in model container [2018-11-23 11:55:24,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (2/3) ... [2018-11-23 11:55:24,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317ef78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:24, skipping insertion in model container [2018-11-23 11:55:24,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:24" (3/3) ... [2018-11-23 11:55:24,747 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init8_false-unreach-call_ground.i [2018-11-23 11:55:24,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:24,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:24,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:24,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:24,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:24,815 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:24,815 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:24,815 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:24,815 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:24,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:24,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:24,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 11:55:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:55:24,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1916738342, now seen corresponding path program 1 times [2018-11-23 11:55:24,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 11:55:25,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 11:55:25,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 11:55:25,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #139#return; {40#true} is VALID [2018-11-23 11:55:25,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret2 := main(); {40#true} is VALID [2018-11-23 11:55:25,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40#true} is VALID [2018-11-23 11:55:25,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 11:55:25,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 11:55:25,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {41#false} assume !(~i~0 < 100000); {41#false} is VALID [2018-11-23 11:55:25,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} havoc ~x~0;~x~0 := 0; {41#false} is VALID [2018-11-23 11:55:25,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {41#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41#false} is VALID [2018-11-23 11:55:25,017 INFO L256 TraceCheckUtils]: 23: Hoare triple {41#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {41#false} is VALID [2018-11-23 11:55:25,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-23 11:55:25,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2018-11-23 11:55:25,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 11:55:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:25,032 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:55:25,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:25,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:25,311 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 11:55:25,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:25,321 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 11:55:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,449 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2018-11-23 11:55:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:25,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 11:55:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2018-11-23 11:55:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2018-11-23 11:55:25,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2018-11-23 11:55:25,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:25,752 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:55:25,753 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:55:25,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:55:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 11:55:25,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:25,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:25,829 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:25,830 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,835 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 11:55:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 11:55:25,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,836 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:25,837 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,842 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-23 11:55:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 11:55:25,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:25,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:55:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 11:55:25,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2018-11-23 11:55:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:25,851 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 11:55:25,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 11:55:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:55:25,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:25,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:25,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:25,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash -330794466, now seen corresponding path program 1 times [2018-11-23 11:55:25,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:25,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-23 11:55:26,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {247#true} is VALID [2018-11-23 11:55:26,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-23 11:55:26,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #139#return; {247#true} is VALID [2018-11-23 11:55:26,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2018-11-23 11:55:26,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {249#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {249#(= main_~i~0 0)} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {248#false} ~i~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {248#false} assume !(~i~0 < 100000); {248#false} is VALID [2018-11-23 11:55:26,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {248#false} havoc ~x~0;~x~0 := 0; {248#false} is VALID [2018-11-23 11:55:26,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {248#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {248#false} is VALID [2018-11-23 11:55:26,054 INFO L256 TraceCheckUtils]: 23: Hoare triple {248#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {248#false} is VALID [2018-11-23 11:55:26,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-23 11:55:26,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {248#false} assume 0 == ~cond; {248#false} is VALID [2018-11-23 11:55:26,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-23 11:55:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:26,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:26,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:26,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:55:26,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:26,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:26,343 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 11:55:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:26,345 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2018-11-23 11:55:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,725 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2018-11-23 11:55:26,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 11:55:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:55:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:55:26,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 11:55:26,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:26,913 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:55:26,914 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:55:26,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:55:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:55:27,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:27,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:27,008 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:27,009 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,013 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:55:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:55:27,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,014 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:27,014 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,018 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:55:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:55:27,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:27,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:55:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 11:55:27,023 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 11:55:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:27,023 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 11:55:27,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 11:55:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:55:27,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1167956326, now seen corresponding path program 1 times [2018-11-23 11:55:27,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:55:27,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 11:55:27,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:55:27,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #139#return; {493#true} is VALID [2018-11-23 11:55:27,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret2 := main(); {493#true} is VALID [2018-11-23 11:55:27,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {495#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {496#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {494#false} havoc ~x~0;~x~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {494#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {494#false} is VALID [2018-11-23 11:55:27,270 INFO L256 TraceCheckUtils]: 31: Hoare triple {494#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {494#false} is VALID [2018-11-23 11:55:27,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 11:55:27,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 11:55:27,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:55:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:55:27,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:27,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:27,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:55:27,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {493#true} is VALID [2018-11-23 11:55:27,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:55:27,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #139#return; {493#true} is VALID [2018-11-23 11:55:27,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret2 := main(); {493#true} is VALID [2018-11-23 11:55:27,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {515#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {496#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#(<= main_~i~0 1)} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {494#false} ~i~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {494#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {494#false} is VALID [2018-11-23 11:55:27,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {494#false} assume !(~i~0 < 100000); {494#false} is VALID [2018-11-23 11:55:27,709 INFO L273 TraceCheckUtils]: 29: Hoare triple {494#false} havoc ~x~0;~x~0 := 0; {494#false} is VALID [2018-11-23 11:55:27,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {494#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {494#false} is VALID [2018-11-23 11:55:27,710 INFO L256 TraceCheckUtils]: 31: Hoare triple {494#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {494#false} is VALID [2018-11-23 11:55:27,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2018-11-23 11:55:27,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2018-11-23 11:55:27,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:55:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:55:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:27,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:55:27,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:27,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:27,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:27,900 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-11-23 11:55:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,303 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2018-11-23 11:55:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:28,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 11:55:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 11:55:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 11:55:28,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-23 11:55:28,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,580 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:55:28,581 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:55:28,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:55:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:55:28,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:28,618 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:28,619 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,622 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 11:55:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:55:28,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,623 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:28,623 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,627 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 11:55:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:55:28,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:55:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 11:55:28,631 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 35 [2018-11-23 11:55:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,632 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 11:55:28,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:55:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:55:28,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,634 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1255820446, now seen corresponding path program 2 times [2018-11-23 11:55:28,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-23 11:55:28,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {905#true} is VALID [2018-11-23 11:55:28,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-23 11:55:28,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #139#return; {905#true} is VALID [2018-11-23 11:55:28,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret2 := main(); {905#true} is VALID [2018-11-23 11:55:28,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {907#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {907#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {908#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {909#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {909#(<= main_~i~0 2)} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {906#false} ~i~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {906#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {906#false} is VALID [2018-11-23 11:55:28,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {906#false} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:28,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {906#false} havoc ~x~0;~x~0 := 0; {906#false} is VALID [2018-11-23 11:55:28,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {906#false} is VALID [2018-11-23 11:55:28,802 INFO L256 TraceCheckUtils]: 39: Hoare triple {906#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {906#false} is VALID [2018-11-23 11:55:28,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {906#false} ~cond := #in~cond; {906#false} is VALID [2018-11-23 11:55:28,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {906#false} assume 0 == ~cond; {906#false} is VALID [2018-11-23 11:55:28,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-23 11:55:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:55:28,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:28,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:28,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:28,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:28,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:29,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-23 11:55:29,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {905#true} is VALID [2018-11-23 11:55:29,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-23 11:55:29,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #139#return; {905#true} is VALID [2018-11-23 11:55:29,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret2 := main(); {905#true} is VALID [2018-11-23 11:55:29,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {905#true} ~i~0 := 0; {905#true} is VALID [2018-11-23 11:55:29,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {905#true} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {905#true} is VALID [2018-11-23 11:55:29,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {905#true} assume !(~i~0 < 100000); {905#true} is VALID [2018-11-23 11:55:29,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {905#true} ~i~0 := 0; {1012#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:29,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {1012#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {908#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {908#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {909#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {909#(<= main_~i~0 2)} assume !(~i~0 < 100000); {906#false} is VALID [2018-11-23 11:55:29,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {906#false} havoc ~x~0;~x~0 := 0; {906#false} is VALID [2018-11-23 11:55:29,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {906#false} is VALID [2018-11-23 11:55:29,029 INFO L256 TraceCheckUtils]: 39: Hoare triple {906#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {906#false} is VALID [2018-11-23 11:55:29,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {906#false} ~cond := #in~cond; {906#false} is VALID [2018-11-23 11:55:29,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {906#false} assume 0 == ~cond; {906#false} is VALID [2018-11-23 11:55:29,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-23 11:55:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:55:29,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:29,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:29,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 11:55:29,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:29,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:29,187 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 11:55:29,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:29,189 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2018-11-23 11:55:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,535 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2018-11-23 11:55:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:29,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 11:55:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 11:55:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 11:55:29,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2018-11-23 11:55:29,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,685 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:55:29,685 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:55:29,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:55:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:55:29,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:29,796 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:29,796 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,799 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 11:55:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 11:55:29,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,801 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:29,801 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,804 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 11:55:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 11:55:29,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:55:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 11:55:29,809 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 43 [2018-11-23 11:55:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,809 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 11:55:29,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 11:55:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:29,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,811 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,814 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2017193242, now seen corresponding path program 3 times [2018-11-23 11:55:29,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {1404#true} call ULTIMATE.init(); {1404#true} is VALID [2018-11-23 11:55:30,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {1404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1404#true} is VALID [2018-11-23 11:55:30,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {1404#true} assume true; {1404#true} is VALID [2018-11-23 11:55:30,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1404#true} {1404#true} #139#return; {1404#true} is VALID [2018-11-23 11:55:30,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1404#true} call #t~ret2 := main(); {1404#true} is VALID [2018-11-23 11:55:30,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {1404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1406#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {1406#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1407#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {1407#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1408#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {1408#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1409#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {1409#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,037 INFO L273 TraceCheckUtils]: 28: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 43: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,041 INFO L273 TraceCheckUtils]: 44: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {1405#false} havoc ~x~0;~x~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,041 INFO L273 TraceCheckUtils]: 46: Hoare triple {1405#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1405#false} is VALID [2018-11-23 11:55:30,042 INFO L256 TraceCheckUtils]: 47: Hoare triple {1405#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1405#false} is VALID [2018-11-23 11:55:30,042 INFO L273 TraceCheckUtils]: 48: Hoare triple {1405#false} ~cond := #in~cond; {1405#false} is VALID [2018-11-23 11:55:30,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {1405#false} assume 0 == ~cond; {1405#false} is VALID [2018-11-23 11:55:30,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {1405#false} assume !false; {1405#false} is VALID [2018-11-23 11:55:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 11:55:30,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:30,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:30,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:30,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:30,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {1404#true} call ULTIMATE.init(); {1404#true} is VALID [2018-11-23 11:55:30,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {1404#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1404#true} is VALID [2018-11-23 11:55:30,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1404#true} assume true; {1404#true} is VALID [2018-11-23 11:55:30,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1404#true} {1404#true} #139#return; {1404#true} is VALID [2018-11-23 11:55:30,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {1404#true} call #t~ret2 := main(); {1404#true} is VALID [2018-11-23 11:55:30,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {1404#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1404#true} is VALID [2018-11-23 11:55:30,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 11:55:30,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 11:55:30,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 11:55:30,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 11:55:30,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 11:55:30,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {1404#true} ~i~0 := 0; {1404#true} is VALID [2018-11-23 11:55:30,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {1404#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1404#true} is VALID [2018-11-23 11:55:30,291 INFO L273 TraceCheckUtils]: 29: Hoare triple {1404#true} assume !(~i~0 < 100000); {1404#true} is VALID [2018-11-23 11:55:30,292 INFO L273 TraceCheckUtils]: 30: Hoare triple {1404#true} ~i~0 := 0; {1503#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {1503#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1407#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {1407#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1408#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {1408#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1409#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {1409#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {1405#false} ~i~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {1405#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1405#false} is VALID [2018-11-23 11:55:30,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {1405#false} assume !(~i~0 < 100000); {1405#false} is VALID [2018-11-23 11:55:30,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {1405#false} havoc ~x~0;~x~0 := 0; {1405#false} is VALID [2018-11-23 11:55:30,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {1405#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1405#false} is VALID [2018-11-23 11:55:30,300 INFO L256 TraceCheckUtils]: 47: Hoare triple {1405#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1405#false} is VALID [2018-11-23 11:55:30,301 INFO L273 TraceCheckUtils]: 48: Hoare triple {1405#false} ~cond := #in~cond; {1405#false} is VALID [2018-11-23 11:55:30,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {1405#false} assume 0 == ~cond; {1405#false} is VALID [2018-11-23 11:55:30,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {1405#false} assume !false; {1405#false} is VALID [2018-11-23 11:55:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 11:55:30,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:55:30,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 11:55:30,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:55:30,393 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 11:55:30,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:30,395 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 7 states. [2018-11-23 11:55:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,899 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2018-11-23 11:55:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:30,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 11:55:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-23 11:55:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-23 11:55:30,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2018-11-23 11:55:31,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,155 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:55:31,155 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:55:31,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:55:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 11:55:31,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:31,310 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:31,311 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,314 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 11:55:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 11:55:31,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,316 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:31,316 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,321 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 11:55:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 11:55:31,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:55:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-23 11:55:31,326 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 51 [2018-11-23 11:55:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,326 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-23 11:55:31,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-23 11:55:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:55:31,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,331 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 544374558, now seen corresponding path program 4 times [2018-11-23 11:55:31,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-23 11:55:31,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1990#true} is VALID [2018-11-23 11:55:31,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-23 11:55:31,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} #139#return; {1990#true} is VALID [2018-11-23 11:55:31,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {1990#true} call #t~ret2 := main(); {1990#true} is VALID [2018-11-23 11:55:31,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {1990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1992#(= main_~i~0 0)} is VALID [2018-11-23 11:55:31,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {1992#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1993#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1994#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {1994#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1995#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {1995#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1996#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,555 INFO L273 TraceCheckUtils]: 45: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {1991#false} havoc ~x~0;~x~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {1991#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1991#false} is VALID [2018-11-23 11:55:31,558 INFO L256 TraceCheckUtils]: 55: Hoare triple {1991#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1991#false} is VALID [2018-11-23 11:55:31,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-23 11:55:31,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {1991#false} assume 0 == ~cond; {1991#false} is VALID [2018-11-23 11:55:31,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-23 11:55:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:55:31,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:31,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:31,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:31,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:31,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-23 11:55:31,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1990#true} is VALID [2018-11-23 11:55:31,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-23 11:55:31,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1990#true} {1990#true} #139#return; {1990#true} is VALID [2018-11-23 11:55:31,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {1990#true} call #t~ret2 := main(); {1990#true} is VALID [2018-11-23 11:55:31,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {1990#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2015#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {2015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1993#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1994#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {1994#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1995#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {1995#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1996#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {1996#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,884 INFO L273 TraceCheckUtils]: 47: Hoare triple {1991#false} ~i~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,884 INFO L273 TraceCheckUtils]: 48: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1991#false} is VALID [2018-11-23 11:55:31,885 INFO L273 TraceCheckUtils]: 52: Hoare triple {1991#false} assume !(~i~0 < 100000); {1991#false} is VALID [2018-11-23 11:55:31,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {1991#false} havoc ~x~0;~x~0 := 0; {1991#false} is VALID [2018-11-23 11:55:31,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {1991#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1991#false} is VALID [2018-11-23 11:55:31,886 INFO L256 TraceCheckUtils]: 55: Hoare triple {1991#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1991#false} is VALID [2018-11-23 11:55:31,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-23 11:55:31,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {1991#false} assume 0 == ~cond; {1991#false} is VALID [2018-11-23 11:55:31,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-23 11:55:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 11:55:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:31,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:31,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 11:55:31,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:32,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:32,048 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2018-11-23 11:55:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,803 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-11-23 11:55:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:32,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 11:55:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:55:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:55:32,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-23 11:55:32,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,975 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:55:32,976 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:55:32,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:55:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 11:55:33,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:33,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:33,098 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:33,098 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:33,101 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 11:55:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 11:55:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:33,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:33,102 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:33,102 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:33,105 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 11:55:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 11:55:33,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:33,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:33,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:33,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:55:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-23 11:55:33,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 59 [2018-11-23 11:55:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:33,109 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-23 11:55:33,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 11:55:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:55:33,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:33,110 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:33,110 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:33,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash 325227418, now seen corresponding path program 5 times [2018-11-23 11:55:33,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:33,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2018-11-23 11:55:33,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {2663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2663#true} is VALID [2018-11-23 11:55:33,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {2663#true} assume true; {2663#true} is VALID [2018-11-23 11:55:33,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2663#true} {2663#true} #139#return; {2663#true} is VALID [2018-11-23 11:55:33,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {2663#true} call #t~ret2 := main(); {2663#true} is VALID [2018-11-23 11:55:33,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {2663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2665#(= main_~i~0 0)} is VALID [2018-11-23 11:55:33,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {2665#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2666#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {2666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2667#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {2667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2668#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {2668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2669#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {2669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2670#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {2670#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 46: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,530 INFO L273 TraceCheckUtils]: 47: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 48: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 55: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 56: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 57: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 59: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:33,532 INFO L273 TraceCheckUtils]: 60: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:33,533 INFO L273 TraceCheckUtils]: 61: Hoare triple {2664#false} havoc ~x~0;~x~0 := 0; {2664#false} is VALID [2018-11-23 11:55:33,533 INFO L273 TraceCheckUtils]: 62: Hoare triple {2664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2664#false} is VALID [2018-11-23 11:55:33,533 INFO L256 TraceCheckUtils]: 63: Hoare triple {2664#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {2664#false} is VALID [2018-11-23 11:55:33,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {2664#false} ~cond := #in~cond; {2664#false} is VALID [2018-11-23 11:55:33,533 INFO L273 TraceCheckUtils]: 65: Hoare triple {2664#false} assume 0 == ~cond; {2664#false} is VALID [2018-11-23 11:55:33,534 INFO L273 TraceCheckUtils]: 66: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2018-11-23 11:55:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:33,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:33,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:49,757 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:55:49,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:49,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {2663#true} call ULTIMATE.init(); {2663#true} is VALID [2018-11-23 11:55:49,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {2663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2663#true} is VALID [2018-11-23 11:55:49,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {2663#true} assume true; {2663#true} is VALID [2018-11-23 11:55:49,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2663#true} {2663#true} #139#return; {2663#true} is VALID [2018-11-23 11:55:49,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {2663#true} call #t~ret2 := main(); {2663#true} is VALID [2018-11-23 11:55:49,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {2663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2663#true} is VALID [2018-11-23 11:55:49,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 11:55:49,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 11:55:49,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 11:55:49,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {2663#true} ~i~0 := 0; {2663#true} is VALID [2018-11-23 11:55:49,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {2663#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2663#true} is VALID [2018-11-23 11:55:49,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {2663#true} assume !(~i~0 < 100000); {2663#true} is VALID [2018-11-23 11:55:49,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {2663#true} ~i~0 := 0; {2773#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:49,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {2773#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2666#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {2666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2667#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {2667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2668#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {2668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2669#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {2669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2670#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {2670#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 42: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,000 INFO L273 TraceCheckUtils]: 46: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:50,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:50,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,001 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,002 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,002 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:50,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {2664#false} ~i~0 := 0; {2664#false} is VALID [2018-11-23 11:55:50,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,003 INFO L273 TraceCheckUtils]: 56: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,003 INFO L273 TraceCheckUtils]: 57: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,003 INFO L273 TraceCheckUtils]: 58: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {2664#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2664#false} is VALID [2018-11-23 11:55:50,004 INFO L273 TraceCheckUtils]: 60: Hoare triple {2664#false} assume !(~i~0 < 100000); {2664#false} is VALID [2018-11-23 11:55:50,004 INFO L273 TraceCheckUtils]: 61: Hoare triple {2664#false} havoc ~x~0;~x~0 := 0; {2664#false} is VALID [2018-11-23 11:55:50,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {2664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2664#false} is VALID [2018-11-23 11:55:50,004 INFO L256 TraceCheckUtils]: 63: Hoare triple {2664#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {2664#false} is VALID [2018-11-23 11:55:50,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {2664#false} ~cond := #in~cond; {2664#false} is VALID [2018-11-23 11:55:50,005 INFO L273 TraceCheckUtils]: 65: Hoare triple {2664#false} assume 0 == ~cond; {2664#false} is VALID [2018-11-23 11:55:50,005 INFO L273 TraceCheckUtils]: 66: Hoare triple {2664#false} assume !false; {2664#false} is VALID [2018-11-23 11:55:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:50,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:50,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:50,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 11:55:50,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:50,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:50,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:50,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:50,102 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2018-11-23 11:55:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,850 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2018-11-23 11:55:50,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:50,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 11:55:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-23 11:55:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-23 11:55:50,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 128 transitions. [2018-11-23 11:55:51,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:51,008 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:55:51,008 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:55:51,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:55:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 11:55:51,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:51,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:51,116 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:51,116 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:51,119 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:55:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 11:55:51,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:51,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:51,120 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:51,121 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:51,123 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:55:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 11:55:51,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:51,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:51,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:51,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:55:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 11:55:51,128 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 67 [2018-11-23 11:55:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:51,128 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 11:55:51,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 11:55:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:55:51,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:51,129 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:51,129 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:51,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1206981022, now seen corresponding path program 6 times [2018-11-23 11:55:51,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:51,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 11:55:51,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3423#true} is VALID [2018-11-23 11:55:51,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 11:55:51,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3423#true} {3423#true} #139#return; {3423#true} is VALID [2018-11-23 11:55:51,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 11:55:51,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {3423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3425#(= main_~i~0 0)} is VALID [2018-11-23 11:55:51,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {3425#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3426#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {3426#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3427#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {3427#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3428#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {3428#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3429#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {3429#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3430#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {3430#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3431#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {3431#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 36: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,328 INFO L273 TraceCheckUtils]: 37: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 40: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 43: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 47: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 48: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 50: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,330 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 54: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 55: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 57: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 58: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 59: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 60: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 61: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,331 INFO L273 TraceCheckUtils]: 62: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 63: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 64: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 65: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 66: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 67: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 68: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 69: Hoare triple {3424#false} havoc ~x~0;~x~0 := 0; {3424#false} is VALID [2018-11-23 11:55:51,332 INFO L273 TraceCheckUtils]: 70: Hoare triple {3424#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3424#false} is VALID [2018-11-23 11:55:51,333 INFO L256 TraceCheckUtils]: 71: Hoare triple {3424#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3424#false} is VALID [2018-11-23 11:55:51,333 INFO L273 TraceCheckUtils]: 72: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 11:55:51,333 INFO L273 TraceCheckUtils]: 73: Hoare triple {3424#false} assume 0 == ~cond; {3424#false} is VALID [2018-11-23 11:55:51,333 INFO L273 TraceCheckUtils]: 74: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 11:55:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:55:51,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:51,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:54,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:55:54,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:54,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:55,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {3423#true} call ULTIMATE.init(); {3423#true} is VALID [2018-11-23 11:55:55,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {3423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3423#true} is VALID [2018-11-23 11:55:55,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {3423#true} assume true; {3423#true} is VALID [2018-11-23 11:55:55,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3423#true} {3423#true} #139#return; {3423#true} is VALID [2018-11-23 11:55:55,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {3423#true} call #t~ret2 := main(); {3423#true} is VALID [2018-11-23 11:55:55,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {3423#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3450#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:55,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {3450#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3426#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:55,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {3426#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3427#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:55,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {3427#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3428#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:55,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {3428#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3429#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:55,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {3429#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3430#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:55,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {3430#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3431#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:55,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {3431#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,050 INFO L273 TraceCheckUtils]: 40: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,051 INFO L273 TraceCheckUtils]: 45: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,051 INFO L273 TraceCheckUtils]: 46: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,051 INFO L273 TraceCheckUtils]: 47: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,052 INFO L273 TraceCheckUtils]: 48: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,052 INFO L273 TraceCheckUtils]: 49: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,052 INFO L273 TraceCheckUtils]: 50: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,052 INFO L273 TraceCheckUtils]: 51: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,053 INFO L273 TraceCheckUtils]: 52: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,053 INFO L273 TraceCheckUtils]: 53: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,053 INFO L273 TraceCheckUtils]: 56: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 57: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 58: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 59: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 61: Hoare triple {3424#false} ~i~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,054 INFO L273 TraceCheckUtils]: 62: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,055 INFO L273 TraceCheckUtils]: 63: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,055 INFO L273 TraceCheckUtils]: 64: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {3424#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3424#false} is VALID [2018-11-23 11:55:55,056 INFO L273 TraceCheckUtils]: 68: Hoare triple {3424#false} assume !(~i~0 < 100000); {3424#false} is VALID [2018-11-23 11:55:55,056 INFO L273 TraceCheckUtils]: 69: Hoare triple {3424#false} havoc ~x~0;~x~0 := 0; {3424#false} is VALID [2018-11-23 11:55:55,056 INFO L273 TraceCheckUtils]: 70: Hoare triple {3424#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3424#false} is VALID [2018-11-23 11:55:55,057 INFO L256 TraceCheckUtils]: 71: Hoare triple {3424#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3424#false} is VALID [2018-11-23 11:55:55,057 INFO L273 TraceCheckUtils]: 72: Hoare triple {3424#false} ~cond := #in~cond; {3424#false} is VALID [2018-11-23 11:55:55,057 INFO L273 TraceCheckUtils]: 73: Hoare triple {3424#false} assume 0 == ~cond; {3424#false} is VALID [2018-11-23 11:55:55,057 INFO L273 TraceCheckUtils]: 74: Hoare triple {3424#false} assume !false; {3424#false} is VALID [2018-11-23 11:55:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:55:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:55,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 11:55:55,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:55,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:55,133 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 11:55:55,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:55,134 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2018-11-23 11:55:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,695 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2018-11-23 11:55:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:55,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-23 11:55:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2018-11-23 11:55:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2018-11-23 11:55:55,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 136 transitions. [2018-11-23 11:55:55,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:55,858 INFO L225 Difference]: With dead ends: 155 [2018-11-23 11:55:55,859 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:55:55,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:55:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 11:55:55,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:55,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:55,924 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:55,924 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,928 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 11:55:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 11:55:55,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,928 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:55,928 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,931 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 11:55:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 11:55:55,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:55:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-23 11:55:55,934 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 75 [2018-11-23 11:55:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,935 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-23 11:55:55,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 11:55:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:55:55,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,936 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:55,936 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 192305690, now seen corresponding path program 7 times [2018-11-23 11:55:55,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {4270#true} call ULTIMATE.init(); {4270#true} is VALID [2018-11-23 11:55:56,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {4270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4270#true} is VALID [2018-11-23 11:55:56,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {4270#true} assume true; {4270#true} is VALID [2018-11-23 11:55:56,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4270#true} {4270#true} #139#return; {4270#true} is VALID [2018-11-23 11:55:56,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {4270#true} call #t~ret2 := main(); {4270#true} is VALID [2018-11-23 11:55:56,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {4270#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4272#(= main_~i~0 0)} is VALID [2018-11-23 11:55:56,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {4272#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4273#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {4273#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4274#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {4274#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4275#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {4275#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4276#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {4276#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4277#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {4277#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4278#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {4278#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4279#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 35: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 40: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 41: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 43: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 47: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 48: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 53: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 56: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 57: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,388 INFO L273 TraceCheckUtils]: 58: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 70: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,391 INFO L273 TraceCheckUtils]: 76: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {4271#false} havoc ~x~0;~x~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,392 INFO L273 TraceCheckUtils]: 78: Hoare triple {4271#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4271#false} is VALID [2018-11-23 11:55:56,392 INFO L256 TraceCheckUtils]: 79: Hoare triple {4271#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {4271#false} is VALID [2018-11-23 11:55:56,392 INFO L273 TraceCheckUtils]: 80: Hoare triple {4271#false} ~cond := #in~cond; {4271#false} is VALID [2018-11-23 11:55:56,393 INFO L273 TraceCheckUtils]: 81: Hoare triple {4271#false} assume 0 == ~cond; {4271#false} is VALID [2018-11-23 11:55:56,393 INFO L273 TraceCheckUtils]: 82: Hoare triple {4271#false} assume !false; {4271#false} is VALID [2018-11-23 11:55:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:55:56,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:56,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:56,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {4270#true} call ULTIMATE.init(); {4270#true} is VALID [2018-11-23 11:55:56,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {4270#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4270#true} is VALID [2018-11-23 11:55:56,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {4270#true} assume true; {4270#true} is VALID [2018-11-23 11:55:56,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4270#true} {4270#true} #139#return; {4270#true} is VALID [2018-11-23 11:55:56,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {4270#true} call #t~ret2 := main(); {4270#true} is VALID [2018-11-23 11:55:56,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {4270#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4298#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {4298#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4273#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {4273#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4274#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {4274#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4275#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {4275#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4276#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {4276#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4277#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {4277#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4278#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {4278#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4279#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,676 INFO L273 TraceCheckUtils]: 41: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 43: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 44: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 45: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 47: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 51: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 55: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 56: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,678 INFO L273 TraceCheckUtils]: 57: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 59: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 62: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 63: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 66: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 67: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 68: Hoare triple {4271#false} ~i~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 69: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 70: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 71: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 72: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 73: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,680 INFO L273 TraceCheckUtils]: 74: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 75: Hoare triple {4271#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 76: Hoare triple {4271#false} assume !(~i~0 < 100000); {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 77: Hoare triple {4271#false} havoc ~x~0;~x~0 := 0; {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 78: Hoare triple {4271#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L256 TraceCheckUtils]: 79: Hoare triple {4271#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 80: Hoare triple {4271#false} ~cond := #in~cond; {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 81: Hoare triple {4271#false} assume 0 == ~cond; {4271#false} is VALID [2018-11-23 11:55:56,681 INFO L273 TraceCheckUtils]: 82: Hoare triple {4271#false} assume !false; {4271#false} is VALID [2018-11-23 11:55:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:55:56,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:56,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:56,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 11:55:56,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:56,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:56,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:56,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:56,748 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 11 states. [2018-11-23 11:55:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,430 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-11-23 11:55:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:57,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-23 11:55:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2018-11-23 11:55:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2018-11-23 11:55:57,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 144 transitions. [2018-11-23 11:55:57,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:57,610 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:55:57,610 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:55:57,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:55:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 11:55:57,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:57,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 11:55:57,693 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:55:57,693 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:55:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,696 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 11:55:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 11:55:57,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:57,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:57,699 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:55:57,700 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:55:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:57,705 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-23 11:55:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 11:55:57,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:57,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:57,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:57,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:55:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-23 11:55:57,710 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 83 [2018-11-23 11:55:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:57,710 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-23 11:55:57,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 11:55:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:55:57,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:57,712 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:57,712 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:57,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1640627170, now seen corresponding path program 8 times [2018-11-23 11:55:57,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:57,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {5204#true} call ULTIMATE.init(); {5204#true} is VALID [2018-11-23 11:55:57,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {5204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5204#true} is VALID [2018-11-23 11:55:57,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2018-11-23 11:55:57,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5204#true} #139#return; {5204#true} is VALID [2018-11-23 11:55:57,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {5204#true} call #t~ret2 := main(); {5204#true} is VALID [2018-11-23 11:55:57,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {5204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5206#(= main_~i~0 0)} is VALID [2018-11-23 11:55:57,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {5206#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5207#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {5207#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5208#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {5208#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5209#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {5209#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5210#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {5210#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5211#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {5211#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5212#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {5212#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5213#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {5213#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5214#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {5214#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:57,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:57,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:57,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 33: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 37: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 38: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 43: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 44: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 46: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 48: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 56: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 61: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,005 INFO L273 TraceCheckUtils]: 62: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 63: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 64: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 67: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 68: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,006 INFO L273 TraceCheckUtils]: 69: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 70: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 71: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 72: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 73: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 74: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 75: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 76: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 77: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,007 INFO L273 TraceCheckUtils]: 78: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 79: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 80: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 81: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 84: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 85: Hoare triple {5205#false} havoc ~x~0;~x~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,008 INFO L273 TraceCheckUtils]: 86: Hoare triple {5205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5205#false} is VALID [2018-11-23 11:55:58,009 INFO L256 TraceCheckUtils]: 87: Hoare triple {5205#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {5205#false} is VALID [2018-11-23 11:55:58,009 INFO L273 TraceCheckUtils]: 88: Hoare triple {5205#false} ~cond := #in~cond; {5205#false} is VALID [2018-11-23 11:55:58,009 INFO L273 TraceCheckUtils]: 89: Hoare triple {5205#false} assume 0 == ~cond; {5205#false} is VALID [2018-11-23 11:55:58,009 INFO L273 TraceCheckUtils]: 90: Hoare triple {5205#false} assume !false; {5205#false} is VALID [2018-11-23 11:55:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-23 11:55:58,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:58,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:58,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:58,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:58,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:58,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:58,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {5204#true} call ULTIMATE.init(); {5204#true} is VALID [2018-11-23 11:55:58,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {5204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5204#true} is VALID [2018-11-23 11:55:58,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2018-11-23 11:55:58,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5204#true} #139#return; {5204#true} is VALID [2018-11-23 11:55:58,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {5204#true} call #t~ret2 := main(); {5204#true} is VALID [2018-11-23 11:55:58,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {5204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5233#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:58,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {5233#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5207#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:58,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {5207#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5208#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:58,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {5208#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5209#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:58,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {5209#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5210#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:58,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {5210#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5211#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:58,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {5211#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5212#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:58,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {5212#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5213#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:58,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {5213#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5214#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:58,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {5214#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,291 INFO L273 TraceCheckUtils]: 29: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,293 INFO L273 TraceCheckUtils]: 45: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 50: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 52: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,294 INFO L273 TraceCheckUtils]: 53: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 54: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 55: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 56: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 57: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 58: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 59: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 60: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 62: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 65: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 72: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 73: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 74: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 75: Hoare triple {5205#false} ~i~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 76: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 79: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 80: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 81: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 82: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 83: Hoare triple {5205#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 84: Hoare triple {5205#false} assume !(~i~0 < 100000); {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 85: Hoare triple {5205#false} havoc ~x~0;~x~0 := 0; {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L273 TraceCheckUtils]: 86: Hoare triple {5205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5205#false} is VALID [2018-11-23 11:55:58,298 INFO L256 TraceCheckUtils]: 87: Hoare triple {5205#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {5205#false} is VALID [2018-11-23 11:55:58,299 INFO L273 TraceCheckUtils]: 88: Hoare triple {5205#false} ~cond := #in~cond; {5205#false} is VALID [2018-11-23 11:55:58,299 INFO L273 TraceCheckUtils]: 89: Hoare triple {5205#false} assume 0 == ~cond; {5205#false} is VALID [2018-11-23 11:55:58,299 INFO L273 TraceCheckUtils]: 90: Hoare triple {5205#false} assume !false; {5205#false} is VALID [2018-11-23 11:55:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-23 11:55:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:58,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-23 11:55:58,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:58,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:58,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:58,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:58,360 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 12 states. [2018-11-23 11:55:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,226 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2018-11-23 11:55:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:59,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-23 11:55:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-23 11:55:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-23 11:55:59,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 152 transitions. [2018-11-23 11:55:59,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:59,867 INFO L225 Difference]: With dead ends: 185 [2018-11-23 11:55:59,867 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:55:59,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:55:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 11:55:59,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:59,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2018-11-23 11:55:59,947 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 11:55:59,947 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 11:55:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,949 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 11:55:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 11:55:59,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,950 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 11:55:59,950 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 11:55:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,952 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 11:55:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 11:55:59,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:59,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:55:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-11-23 11:55:59,956 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 91 [2018-11-23 11:55:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:59,956 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-23 11:55:59,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-11-23 11:55:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:55:59,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:59,958 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:59,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:59,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -32030566, now seen corresponding path program 9 times [2018-11-23 11:55:59,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:59,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:00,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {6225#true} call ULTIMATE.init(); {6225#true} is VALID [2018-11-23 11:56:00,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {6225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6225#true} is VALID [2018-11-23 11:56:00,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {6225#true} assume true; {6225#true} is VALID [2018-11-23 11:56:00,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6225#true} {6225#true} #139#return; {6225#true} is VALID [2018-11-23 11:56:00,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {6225#true} call #t~ret2 := main(); {6225#true} is VALID [2018-11-23 11:56:00,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {6225#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6227#(= main_~i~0 0)} is VALID [2018-11-23 11:56:00,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {6227#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6228#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {6228#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6229#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {6229#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6230#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {6230#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6231#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {6231#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6232#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6233#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6234#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {6234#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6235#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {6235#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6236#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {6236#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,219 INFO L273 TraceCheckUtils]: 30: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 33: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 34: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 35: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 40: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 45: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 46: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 47: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 49: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 50: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 51: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 54: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 55: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,222 INFO L273 TraceCheckUtils]: 56: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 57: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 58: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 59: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 60: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 61: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 63: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 64: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,223 INFO L273 TraceCheckUtils]: 65: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 66: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 67: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 68: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 69: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 70: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 71: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 72: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,224 INFO L273 TraceCheckUtils]: 73: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 75: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 76: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 77: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 78: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 79: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 80: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,225 INFO L273 TraceCheckUtils]: 81: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 82: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 83: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 84: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 85: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 86: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 87: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 89: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,226 INFO L273 TraceCheckUtils]: 90: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 91: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 92: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 93: Hoare triple {6226#false} havoc ~x~0;~x~0 := 0; {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 94: Hoare triple {6226#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L256 TraceCheckUtils]: 95: Hoare triple {6226#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 96: Hoare triple {6226#false} ~cond := #in~cond; {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 97: Hoare triple {6226#false} assume 0 == ~cond; {6226#false} is VALID [2018-11-23 11:56:00,227 INFO L273 TraceCheckUtils]: 98: Hoare triple {6226#false} assume !false; {6226#false} is VALID [2018-11-23 11:56:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 11:56:00,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:00,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:16,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:56:16,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:16,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:16,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {6225#true} call ULTIMATE.init(); {6225#true} is VALID [2018-11-23 11:56:16,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {6225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {6225#true} assume true; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6225#true} {6225#true} #139#return; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {6225#true} call #t~ret2 := main(); {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {6225#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {6225#true} assume !(~i~0 < 100000); {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {6225#true} ~i~0 := 0; {6225#true} is VALID [2018-11-23 11:56:16,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {6225#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6225#true} is VALID [2018-11-23 11:56:16,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {6225#true} assume !(~i~0 < 100000); {6225#true} is VALID [2018-11-23 11:56:16,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {6225#true} ~i~0 := 0; {6321#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:16,385 INFO L273 TraceCheckUtils]: 28: Hoare triple {6321#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6228#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:16,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {6228#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6229#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:16,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {6229#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6230#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:16,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {6230#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6231#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:16,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {6231#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6232#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:16,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {6232#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6233#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:16,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {6233#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6234#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:16,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {6234#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6235#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:16,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {6235#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6236#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:16,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {6236#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,393 INFO L273 TraceCheckUtils]: 45: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,394 INFO L273 TraceCheckUtils]: 51: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,394 INFO L273 TraceCheckUtils]: 52: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 54: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 55: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,395 INFO L273 TraceCheckUtils]: 58: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 61: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 62: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 63: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 64: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 68: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 72: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 73: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,397 INFO L273 TraceCheckUtils]: 74: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 75: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 76: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 79: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 80: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 81: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {6226#false} ~i~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 86: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 87: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 88: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 89: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 90: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,399 INFO L273 TraceCheckUtils]: 91: Hoare triple {6226#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 92: Hoare triple {6226#false} assume !(~i~0 < 100000); {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 93: Hoare triple {6226#false} havoc ~x~0;~x~0 := 0; {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 94: Hoare triple {6226#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L256 TraceCheckUtils]: 95: Hoare triple {6226#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {6226#false} ~cond := #in~cond; {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 97: Hoare triple {6226#false} assume 0 == ~cond; {6226#false} is VALID [2018-11-23 11:56:16,400 INFO L273 TraceCheckUtils]: 98: Hoare triple {6226#false} assume !false; {6226#false} is VALID [2018-11-23 11:56:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 11:56:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:16,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:56:16,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 11:56:16,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:16,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:56:16,490 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 11:56:16,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:56:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:56:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:56:16,491 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 13 states. [2018-11-23 11:56:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:18,008 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-11-23 11:56:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:56:18,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2018-11-23 11:56:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:56:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2018-11-23 11:56:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:56:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2018-11-23 11:56:18,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 160 transitions. [2018-11-23 11:56:18,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:18,199 INFO L225 Difference]: With dead ends: 200 [2018-11-23 11:56:18,199 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 11:56:18,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:56:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 11:56:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 11:56:18,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:18,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 11:56:18,308 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 11:56:18,309 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 11:56:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:18,311 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-23 11:56:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 11:56:18,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:18,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:18,312 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 11:56:18,312 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 11:56:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:18,315 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-23 11:56:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 11:56:18,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:18,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:18,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:18,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:56:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-11-23 11:56:18,319 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 99 [2018-11-23 11:56:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:18,319 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-11-23 11:56:18,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:56:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 11:56:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:56:18,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:18,321 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:18,321 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:18,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 35739294, now seen corresponding path program 10 times [2018-11-23 11:56:18,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:18,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:19,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 11:56:19,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 11:56:19,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:56:19,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #139#return; {7333#true} is VALID [2018-11-23 11:56:19,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret2 := main(); {7333#true} is VALID [2018-11-23 11:56:19,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7335#(= main_~i~0 0)} is VALID [2018-11-23 11:56:19,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {7335#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:19,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:19,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:19,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:19,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {7339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:19,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {7340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:19,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {7341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:19,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {7342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:19,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {7343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:19,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {7344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:19,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {7345#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,318 INFO L273 TraceCheckUtils]: 36: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 42: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 43: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 49: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 50: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,320 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 67: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 70: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 71: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 72: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 73: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 74: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 75: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 76: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 77: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,323 INFO L273 TraceCheckUtils]: 78: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 79: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 81: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 82: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 83: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,324 INFO L273 TraceCheckUtils]: 84: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,325 INFO L273 TraceCheckUtils]: 85: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,325 INFO L273 TraceCheckUtils]: 86: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,325 INFO L273 TraceCheckUtils]: 87: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,325 INFO L273 TraceCheckUtils]: 88: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,325 INFO L273 TraceCheckUtils]: 89: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,326 INFO L273 TraceCheckUtils]: 90: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,326 INFO L273 TraceCheckUtils]: 91: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,326 INFO L273 TraceCheckUtils]: 92: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,326 INFO L273 TraceCheckUtils]: 93: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,327 INFO L273 TraceCheckUtils]: 94: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,327 INFO L273 TraceCheckUtils]: 95: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,327 INFO L273 TraceCheckUtils]: 96: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,327 INFO L273 TraceCheckUtils]: 97: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,327 INFO L273 TraceCheckUtils]: 98: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L273 TraceCheckUtils]: 99: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L273 TraceCheckUtils]: 100: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L273 TraceCheckUtils]: 101: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L273 TraceCheckUtils]: 102: Hoare triple {7334#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L256 TraceCheckUtils]: 103: Hoare triple {7334#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {7334#false} is VALID [2018-11-23 11:56:19,328 INFO L273 TraceCheckUtils]: 104: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 11:56:19,329 INFO L273 TraceCheckUtils]: 105: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 11:56:19,329 INFO L273 TraceCheckUtils]: 106: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 11:56:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-23 11:56:19,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:19,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:19,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:19,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:19,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:19,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 11:56:19,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 11:56:19,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:56:19,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #139#return; {7333#true} is VALID [2018-11-23 11:56:19,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret2 := main(); {7333#true} is VALID [2018-11-23 11:56:19,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7364#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:19,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {7364#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:19,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:19,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:19,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:19,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {7339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:19,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {7340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:19,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {7341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:19,656 INFO L273 TraceCheckUtils]: 13: Hoare triple {7342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:19,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {7343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:19,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {7344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:19,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {7345#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,661 INFO L273 TraceCheckUtils]: 29: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 34: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 41: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,663 INFO L273 TraceCheckUtils]: 42: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 44: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 47: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 51: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 52: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 53: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 56: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 57: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 58: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,665 INFO L273 TraceCheckUtils]: 59: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 63: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,666 INFO L273 TraceCheckUtils]: 67: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 68: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 69: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 70: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 73: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 74: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 75: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,667 INFO L273 TraceCheckUtils]: 76: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 77: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 78: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 79: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 80: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 81: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,668 INFO L273 TraceCheckUtils]: 84: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 85: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 86: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 87: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 88: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {7334#false} ~i~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,669 INFO L273 TraceCheckUtils]: 91: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 92: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 93: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 94: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 95: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 96: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 97: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 98: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,670 INFO L273 TraceCheckUtils]: 99: Hoare triple {7334#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 100: Hoare triple {7334#false} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 101: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 102: Hoare triple {7334#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L256 TraceCheckUtils]: 103: Hoare triple {7334#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 104: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 105: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 11:56:19,671 INFO L273 TraceCheckUtils]: 106: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 11:56:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-23 11:56:19,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:19,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:56:19,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-23 11:56:19,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:19,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:56:19,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:19,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:56:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:56:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:19,734 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 14 states. [2018-11-23 11:56:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:20,554 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-11-23 11:56:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:56:20,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-23 11:56:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2018-11-23 11:56:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:56:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2018-11-23 11:56:20,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 168 transitions. [2018-11-23 11:56:21,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:21,124 INFO L225 Difference]: With dead ends: 215 [2018-11-23 11:56:21,124 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 11:56:21,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:56:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 11:56:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-23 11:56:21,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:21,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-23 11:56:21,212 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 11:56:21,212 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 11:56:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:21,217 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 11:56:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 11:56:21,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:21,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:21,218 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-23 11:56:21,218 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-23 11:56:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:21,222 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 11:56:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 11:56:21,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:21,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:21,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:21,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:56:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-11-23 11:56:21,227 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 107 [2018-11-23 11:56:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:21,227 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-11-23 11:56:21,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:56:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 11:56:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:56:21,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:21,229 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:21,230 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:21,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1494923494, now seen corresponding path program 11 times [2018-11-23 11:56:21,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:21,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:21,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:22,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {8528#true} call ULTIMATE.init(); {8528#true} is VALID [2018-11-23 11:56:22,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {8528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8528#true} is VALID [2018-11-23 11:56:22,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {8528#true} assume true; {8528#true} is VALID [2018-11-23 11:56:22,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8528#true} {8528#true} #139#return; {8528#true} is VALID [2018-11-23 11:56:22,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {8528#true} call #t~ret2 := main(); {8528#true} is VALID [2018-11-23 11:56:22,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {8528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8530#(= main_~i~0 0)} is VALID [2018-11-23 11:56:22,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {8530#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {8531#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {8532#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {8533#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {8534#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {8535#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {8536#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {8537#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {8538#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {8539#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {8540#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {8541#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 37: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 38: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 49: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 50: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 51: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,347 INFO L273 TraceCheckUtils]: 52: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 55: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 56: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 57: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 58: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 59: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,348 INFO L273 TraceCheckUtils]: 60: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 61: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 62: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 63: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 64: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 65: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 66: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 70: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 71: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 73: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 74: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 75: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 78: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 80: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 81: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 82: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 83: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 84: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 86: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 89: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 90: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 91: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 92: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 93: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,352 INFO L273 TraceCheckUtils]: 94: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 95: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 96: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 97: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 98: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 99: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 100: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 101: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 102: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,353 INFO L273 TraceCheckUtils]: 103: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 104: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 105: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 106: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 107: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 108: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 109: Hoare triple {8529#false} havoc ~x~0;~x~0 := 0; {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L273 TraceCheckUtils]: 110: Hoare triple {8529#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8529#false} is VALID [2018-11-23 11:56:22,354 INFO L256 TraceCheckUtils]: 111: Hoare triple {8529#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {8529#false} is VALID [2018-11-23 11:56:22,355 INFO L273 TraceCheckUtils]: 112: Hoare triple {8529#false} ~cond := #in~cond; {8529#false} is VALID [2018-11-23 11:56:22,355 INFO L273 TraceCheckUtils]: 113: Hoare triple {8529#false} assume 0 == ~cond; {8529#false} is VALID [2018-11-23 11:56:22,355 INFO L273 TraceCheckUtils]: 114: Hoare triple {8529#false} assume !false; {8529#false} is VALID [2018-11-23 11:56:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 11:56:22,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:22,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:12,132 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:57:12,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:12,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {8528#true} call ULTIMATE.init(); {8528#true} is VALID [2018-11-23 11:57:12,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {8528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8528#true} is VALID [2018-11-23 11:57:12,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {8528#true} assume true; {8528#true} is VALID [2018-11-23 11:57:12,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8528#true} {8528#true} #139#return; {8528#true} is VALID [2018-11-23 11:57:12,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {8528#true} call #t~ret2 := main(); {8528#true} is VALID [2018-11-23 11:57:12,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {8528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8528#true} is VALID [2018-11-23 11:57:12,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#true} assume !(~i~0 < 100000); {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {8528#true} ~i~0 := 0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {8528#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#true} is VALID [2018-11-23 11:57:12,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {8528#true} assume !(~i~0 < 100000); {8528#true} is VALID [2018-11-23 11:57:12,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {8528#true} ~i~0 := 0; {8638#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:12,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {8638#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {8531#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {8532#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {8533#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {8534#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {8535#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:12,359 INFO L273 TraceCheckUtils]: 38: Hoare triple {8536#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:12,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {8537#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:12,360 INFO L273 TraceCheckUtils]: 40: Hoare triple {8538#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:12,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {8539#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:12,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {8540#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:12,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {8541#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,364 INFO L273 TraceCheckUtils]: 47: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,365 INFO L273 TraceCheckUtils]: 53: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,366 INFO L273 TraceCheckUtils]: 55: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,366 INFO L273 TraceCheckUtils]: 58: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,366 INFO L273 TraceCheckUtils]: 59: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,367 INFO L273 TraceCheckUtils]: 60: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,367 INFO L273 TraceCheckUtils]: 61: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,367 INFO L273 TraceCheckUtils]: 62: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,367 INFO L273 TraceCheckUtils]: 63: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,367 INFO L273 TraceCheckUtils]: 64: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 66: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 67: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 68: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 69: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 70: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 75: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 76: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 77: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 78: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 79: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 80: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,369 INFO L273 TraceCheckUtils]: 81: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 82: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 83: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 84: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 85: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 86: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 87: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 88: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 89: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,370 INFO L273 TraceCheckUtils]: 90: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 91: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 92: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 93: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 95: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 96: Hoare triple {8529#false} ~i~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 97: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 98: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,371 INFO L273 TraceCheckUtils]: 99: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 100: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 101: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 102: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 103: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 104: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 105: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 106: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,372 INFO L273 TraceCheckUtils]: 107: Hoare triple {8529#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 108: Hoare triple {8529#false} assume !(~i~0 < 100000); {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 109: Hoare triple {8529#false} havoc ~x~0;~x~0 := 0; {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 110: Hoare triple {8529#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L256 TraceCheckUtils]: 111: Hoare triple {8529#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 112: Hoare triple {8529#false} ~cond := #in~cond; {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 113: Hoare triple {8529#false} assume 0 == ~cond; {8529#false} is VALID [2018-11-23 11:57:12,373 INFO L273 TraceCheckUtils]: 114: Hoare triple {8529#false} assume !false; {8529#false} is VALID [2018-11-23 11:57:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 11:57:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:57:12,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-23 11:57:12,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:12,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:57:12,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:12,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:57:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:57:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:12,473 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 15 states. [2018-11-23 11:57:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:13,861 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2018-11-23 11:57:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:57:13,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-23 11:57:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 176 transitions. [2018-11-23 11:57:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 176 transitions. [2018-11-23 11:57:13,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 176 transitions. [2018-11-23 11:57:14,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:14,557 INFO L225 Difference]: With dead ends: 230 [2018-11-23 11:57:14,558 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:57:14,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:57:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-23 11:57:14,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:14,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:14,653 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:14,653 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,656 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 11:57:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 11:57:14,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,657 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:14,658 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 11:57:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,661 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 11:57:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 11:57:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:14,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 11:57:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-11-23 11:57:14,665 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 115 [2018-11-23 11:57:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:14,666 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-11-23 11:57:14,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:57:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-23 11:57:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 11:57:14,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:14,668 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:14,668 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:14,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1418922270, now seen corresponding path program 12 times [2018-11-23 11:57:14,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:14,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:14,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:15,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9810#true} is VALID [2018-11-23 11:57:15,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {9810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9810#true} is VALID [2018-11-23 11:57:15,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2018-11-23 11:57:15,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #139#return; {9810#true} is VALID [2018-11-23 11:57:15,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret2 := main(); {9810#true} is VALID [2018-11-23 11:57:15,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {9810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9812#(= main_~i~0 0)} is VALID [2018-11-23 11:57:15,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {9812#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:15,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {9813#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9814#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:15,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {9814#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9815#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:15,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {9815#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9816#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:15,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {9816#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9817#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:15,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {9817#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9818#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:15,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {9818#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9819#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:15,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {9819#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9820#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:15,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {9820#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9821#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:15,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {9821#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9822#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:15,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {9822#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9823#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:15,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {9823#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9824#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:15,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {9824#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,869 INFO L273 TraceCheckUtils]: 24: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,869 INFO L273 TraceCheckUtils]: 25: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,870 INFO L273 TraceCheckUtils]: 27: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,870 INFO L273 TraceCheckUtils]: 30: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,870 INFO L273 TraceCheckUtils]: 31: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 35: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 39: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 40: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 43: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 44: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 45: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 49: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 50: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 51: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 52: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 53: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 54: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 56: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 57: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 58: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 59: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 60: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 65: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 67: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 68: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 70: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 71: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,875 INFO L273 TraceCheckUtils]: 72: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 73: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 74: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 75: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 76: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 77: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 78: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 79: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,876 INFO L273 TraceCheckUtils]: 80: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 81: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 82: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 83: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 84: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 85: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 86: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 87: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,877 INFO L273 TraceCheckUtils]: 89: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 91: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 92: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 93: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 94: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 95: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 96: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 97: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,878 INFO L273 TraceCheckUtils]: 98: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 99: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 100: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 101: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 102: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 103: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 104: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 105: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,879 INFO L273 TraceCheckUtils]: 106: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 107: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 108: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 109: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 110: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 111: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 112: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 113: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 114: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,880 INFO L273 TraceCheckUtils]: 115: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 116: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 117: Hoare triple {9811#false} havoc ~x~0;~x~0 := 0; {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 118: Hoare triple {9811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L256 TraceCheckUtils]: 119: Hoare triple {9811#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 120: Hoare triple {9811#false} ~cond := #in~cond; {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 121: Hoare triple {9811#false} assume 0 == ~cond; {9811#false} is VALID [2018-11-23 11:57:15,881 INFO L273 TraceCheckUtils]: 122: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2018-11-23 11:57:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 11:57:15,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:15,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:53,669 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:57:53,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:53,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:53,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {9810#true} call ULTIMATE.init(); {9810#true} is VALID [2018-11-23 11:57:53,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {9810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9810#true} is VALID [2018-11-23 11:57:53,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {9810#true} assume true; {9810#true} is VALID [2018-11-23 11:57:53,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9810#true} {9810#true} #139#return; {9810#true} is VALID [2018-11-23 11:57:53,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {9810#true} call #t~ret2 := main(); {9810#true} is VALID [2018-11-23 11:57:53,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {9810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 24: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 28: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 41: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 42: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 11:57:53,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {9810#true} ~i~0 := 0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 49: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,910 INFO L273 TraceCheckUtils]: 59: Hoare triple {9810#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9810#true} is VALID [2018-11-23 11:57:53,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {9810#true} assume !(~i~0 < 100000); {9810#true} is VALID [2018-11-23 11:57:53,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {9810#true} ~i~0 := 0; {10011#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:53,916 INFO L273 TraceCheckUtils]: 62: Hoare triple {10011#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:53,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {9813#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9814#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:53,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {9814#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9815#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:53,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {9815#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9816#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:53,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {9816#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9817#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:53,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {9817#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9818#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:53,920 INFO L273 TraceCheckUtils]: 68: Hoare triple {9818#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9819#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:53,921 INFO L273 TraceCheckUtils]: 69: Hoare triple {9819#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9820#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:53,922 INFO L273 TraceCheckUtils]: 70: Hoare triple {9820#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9821#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:53,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {9821#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9822#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:53,924 INFO L273 TraceCheckUtils]: 72: Hoare triple {9822#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9823#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:53,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {9823#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9824#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:53,925 INFO L273 TraceCheckUtils]: 74: Hoare triple {9824#(<= main_~i~0 12)} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:53,926 INFO L273 TraceCheckUtils]: 75: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:53,926 INFO L273 TraceCheckUtils]: 76: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,926 INFO L273 TraceCheckUtils]: 77: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,926 INFO L273 TraceCheckUtils]: 78: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,926 INFO L273 TraceCheckUtils]: 79: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,927 INFO L273 TraceCheckUtils]: 80: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,927 INFO L273 TraceCheckUtils]: 81: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,927 INFO L273 TraceCheckUtils]: 82: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,927 INFO L273 TraceCheckUtils]: 83: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,928 INFO L273 TraceCheckUtils]: 84: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,928 INFO L273 TraceCheckUtils]: 85: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,928 INFO L273 TraceCheckUtils]: 86: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,928 INFO L273 TraceCheckUtils]: 87: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,928 INFO L273 TraceCheckUtils]: 88: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:53,929 INFO L273 TraceCheckUtils]: 89: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:53,929 INFO L273 TraceCheckUtils]: 90: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,929 INFO L273 TraceCheckUtils]: 91: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,929 INFO L273 TraceCheckUtils]: 92: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,929 INFO L273 TraceCheckUtils]: 93: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 94: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 95: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 96: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 98: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 99: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 100: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,930 INFO L273 TraceCheckUtils]: 101: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 102: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {9811#false} ~i~0 := 0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 104: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 105: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 106: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 107: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 108: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,931 INFO L273 TraceCheckUtils]: 109: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 110: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 111: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 112: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 113: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 114: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 115: Hoare triple {9811#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 116: Hoare triple {9811#false} assume !(~i~0 < 100000); {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 117: Hoare triple {9811#false} havoc ~x~0;~x~0 := 0; {9811#false} is VALID [2018-11-23 11:57:53,932 INFO L273 TraceCheckUtils]: 118: Hoare triple {9811#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9811#false} is VALID [2018-11-23 11:57:53,933 INFO L256 TraceCheckUtils]: 119: Hoare triple {9811#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {9811#false} is VALID [2018-11-23 11:57:53,933 INFO L273 TraceCheckUtils]: 120: Hoare triple {9811#false} ~cond := #in~cond; {9811#false} is VALID [2018-11-23 11:57:53,933 INFO L273 TraceCheckUtils]: 121: Hoare triple {9811#false} assume 0 == ~cond; {9811#false} is VALID [2018-11-23 11:57:53,933 INFO L273 TraceCheckUtils]: 122: Hoare triple {9811#false} assume !false; {9811#false} is VALID [2018-11-23 11:57:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 11:57:53,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:53,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:57:53,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-11-23 11:57:53,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:53,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:57:54,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:54,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:57:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:57:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:57:54,042 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 16 states. [2018-11-23 11:57:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:54,903 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2018-11-23 11:57:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:57:54,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-11-23 11:57:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:57:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2018-11-23 11:57:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:57:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2018-11-23 11:57:54,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 184 transitions. [2018-11-23 11:57:55,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:55,653 INFO L225 Difference]: With dead ends: 245 [2018-11-23 11:57:55,653 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 11:57:55,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:57:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 11:57:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-23 11:57:55,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:55,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 136 states. [2018-11-23 11:57:55,803 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 11:57:55,803 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 11:57:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:55,807 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-11-23 11:57:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 11:57:55,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:55,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:55,808 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 11:57:55,809 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 11:57:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:55,814 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-11-23 11:57:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 11:57:55,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:55,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:55,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:55,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 11:57:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-11-23 11:57:55,820 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 123 [2018-11-23 11:57:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:55,820 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-11-23 11:57:55,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:57:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-23 11:57:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 11:57:55,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:55,822 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:55,823 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -545231462, now seen corresponding path program 13 times [2018-11-23 11:57:55,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:55,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:56,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2018-11-23 11:57:56,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11179#true} is VALID [2018-11-23 11:57:56,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2018-11-23 11:57:56,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #139#return; {11179#true} is VALID [2018-11-23 11:57:56,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret2 := main(); {11179#true} is VALID [2018-11-23 11:57:56,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {11179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11181#(= main_~i~0 0)} is VALID [2018-11-23 11:57:56,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {11181#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11182#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:56,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {11182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11183#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:56,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {11183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11184#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:56,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {11184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11185#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:56,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {11185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11186#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:56,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {11186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11187#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:56,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {11187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11188#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:56,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {11188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11189#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:56,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {11189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11190#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:56,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {11190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11191#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:56,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {11191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11192#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:56,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {11192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11193#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:56,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {11193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11194#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:56,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {11194#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,648 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,651 INFO L273 TraceCheckUtils]: 39: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,651 INFO L273 TraceCheckUtils]: 40: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,651 INFO L273 TraceCheckUtils]: 41: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,652 INFO L273 TraceCheckUtils]: 42: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 50: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 57: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 59: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 60: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 62: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 63: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 66: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 67: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 68: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 69: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 70: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 71: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 72: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,656 INFO L273 TraceCheckUtils]: 73: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 74: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 75: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 76: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 78: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 79: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 80: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,657 INFO L273 TraceCheckUtils]: 82: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 83: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 84: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 85: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 86: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 88: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 89: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,658 INFO L273 TraceCheckUtils]: 90: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 91: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 92: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 93: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 94: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 95: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 96: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 97: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 98: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,659 INFO L273 TraceCheckUtils]: 99: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 100: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 101: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 103: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 105: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 106: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,660 INFO L273 TraceCheckUtils]: 107: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 108: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 113: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 114: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,661 INFO L273 TraceCheckUtils]: 115: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 116: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 117: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 118: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 119: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 120: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 121: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 122: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 123: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:56,662 INFO L273 TraceCheckUtils]: 124: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L273 TraceCheckUtils]: 125: Hoare triple {11180#false} havoc ~x~0;~x~0 := 0; {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L273 TraceCheckUtils]: 126: Hoare triple {11180#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L256 TraceCheckUtils]: 127: Hoare triple {11180#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L273 TraceCheckUtils]: 128: Hoare triple {11180#false} ~cond := #in~cond; {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L273 TraceCheckUtils]: 129: Hoare triple {11180#false} assume 0 == ~cond; {11180#false} is VALID [2018-11-23 11:57:56,663 INFO L273 TraceCheckUtils]: 130: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2018-11-23 11:57:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-23 11:57:56,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:56,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:56,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:56,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:57,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2018-11-23 11:57:57,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11179#true} is VALID [2018-11-23 11:57:57,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2018-11-23 11:57:57,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #139#return; {11179#true} is VALID [2018-11-23 11:57:57,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret2 := main(); {11179#true} is VALID [2018-11-23 11:57:57,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {11179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11213#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:57,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {11213#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11182#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:57,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {11182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11183#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:57,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {11183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11184#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:57,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {11184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11185#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:57,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {11185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11186#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:57,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {11186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11187#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:57,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {11187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11188#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:57,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {11188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11189#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:57,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {11189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11190#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:57,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {11190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11191#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:57,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {11191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11192#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:57,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {11192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11193#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:57,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {11193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11194#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:57,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {11194#(<= main_~i~0 13)} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,079 INFO L273 TraceCheckUtils]: 63: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 64: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 70: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 71: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 74: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 75: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 77: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 78: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 81: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 83: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 84: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 85: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 86: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 87: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 88: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 90: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 91: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 92: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 93: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 94: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 96: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,083 INFO L273 TraceCheckUtils]: 97: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 98: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 99: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 100: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 101: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 102: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 103: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 104: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,084 INFO L273 TraceCheckUtils]: 105: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 106: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 107: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 108: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#false} ~i~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 113: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,085 INFO L273 TraceCheckUtils]: 114: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 115: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 116: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 117: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 118: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 119: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 120: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 121: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,086 INFO L273 TraceCheckUtils]: 122: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 123: Hoare triple {11180#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 124: Hoare triple {11180#false} assume !(~i~0 < 100000); {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 125: Hoare triple {11180#false} havoc ~x~0;~x~0 := 0; {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 126: Hoare triple {11180#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L256 TraceCheckUtils]: 127: Hoare triple {11180#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 128: Hoare triple {11180#false} ~cond := #in~cond; {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 129: Hoare triple {11180#false} assume 0 == ~cond; {11180#false} is VALID [2018-11-23 11:57:57,087 INFO L273 TraceCheckUtils]: 130: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2018-11-23 11:57:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-23 11:57:57,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:57,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:57:57,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2018-11-23 11:57:57,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:57,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:57:57,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:57,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:57:57,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:57:57,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:57,188 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 17 states. [2018-11-23 11:57:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,301 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-11-23 11:57:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:57:58,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2018-11-23 11:57:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2018-11-23 11:57:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2018-11-23 11:57:58,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 192 transitions. [2018-11-23 11:57:59,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:59,420 INFO L225 Difference]: With dead ends: 260 [2018-11-23 11:57:59,420 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 11:57:59,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 11:58:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-11-23 11:58:01,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:01,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 144 states. [2018-11-23 11:58:01,407 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2018-11-23 11:58:01,407 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2018-11-23 11:58:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:01,410 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-11-23 11:58:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 11:58:01,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:01,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:01,411 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2018-11-23 11:58:01,411 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2018-11-23 11:58:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:01,413 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-11-23 11:58:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 11:58:01,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:01,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:01,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:01,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:58:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-23 11:58:01,416 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 131 [2018-11-23 11:58:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:01,417 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-23 11:58:01,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:58:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-23 11:58:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:58:01,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:01,419 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:01,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2020285342, now seen corresponding path program 14 times [2018-11-23 11:58:01,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:01,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:01,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:01,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:01,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:01,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {12635#true} call ULTIMATE.init(); {12635#true} is VALID [2018-11-23 11:58:01,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {12635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12635#true} is VALID [2018-11-23 11:58:01,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {12635#true} assume true; {12635#true} is VALID [2018-11-23 11:58:01,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12635#true} {12635#true} #139#return; {12635#true} is VALID [2018-11-23 11:58:01,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {12635#true} call #t~ret2 := main(); {12635#true} is VALID [2018-11-23 11:58:01,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {12635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12637#(= main_~i~0 0)} is VALID [2018-11-23 11:58:01,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {12637#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12638#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:01,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {12638#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:01,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {12639#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:01,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {12640#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:01,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {12641#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12642#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:01,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {12642#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12643#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:01,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {12643#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12644#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:01,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {12644#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12645#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:01,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {12645#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12646#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:01,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {12646#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12647#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:01,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {12647#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12648#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:01,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {12648#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12649#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:01,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {12649#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12650#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:01,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {12650#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12651#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:01,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {12651#(<= main_~i~0 14)} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,885 INFO L273 TraceCheckUtils]: 33: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 41: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 47: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 61: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 63: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 68: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 69: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 70: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 72: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 73: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 75: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 76: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 77: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 78: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,891 INFO L273 TraceCheckUtils]: 79: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 80: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 81: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 82: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 83: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 84: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 85: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 86: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 87: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,892 INFO L273 TraceCheckUtils]: 88: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 89: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 90: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 91: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 92: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 93: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 94: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 95: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,893 INFO L273 TraceCheckUtils]: 96: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 97: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 98: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 99: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 100: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 101: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 102: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 103: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 104: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,894 INFO L273 TraceCheckUtils]: 105: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 106: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 107: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 108: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 109: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 110: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 111: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 112: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 113: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,895 INFO L273 TraceCheckUtils]: 114: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 115: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 116: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 117: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 118: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 119: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 120: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 121: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,896 INFO L273 TraceCheckUtils]: 122: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 123: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 124: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 125: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 126: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 127: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,897 INFO L273 TraceCheckUtils]: 128: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,898 INFO L273 TraceCheckUtils]: 129: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,898 INFO L273 TraceCheckUtils]: 130: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,898 INFO L273 TraceCheckUtils]: 131: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:01,898 INFO L273 TraceCheckUtils]: 132: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:01,899 INFO L273 TraceCheckUtils]: 133: Hoare triple {12636#false} havoc ~x~0;~x~0 := 0; {12636#false} is VALID [2018-11-23 11:58:01,899 INFO L273 TraceCheckUtils]: 134: Hoare triple {12636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12636#false} is VALID [2018-11-23 11:58:01,899 INFO L256 TraceCheckUtils]: 135: Hoare triple {12636#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {12636#false} is VALID [2018-11-23 11:58:01,899 INFO L273 TraceCheckUtils]: 136: Hoare triple {12636#false} ~cond := #in~cond; {12636#false} is VALID [2018-11-23 11:58:01,900 INFO L273 TraceCheckUtils]: 137: Hoare triple {12636#false} assume 0 == ~cond; {12636#false} is VALID [2018-11-23 11:58:01,900 INFO L273 TraceCheckUtils]: 138: Hoare triple {12636#false} assume !false; {12636#false} is VALID [2018-11-23 11:58:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 11:58:01,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:01,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:02,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:02,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:02,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:02,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {12635#true} call ULTIMATE.init(); {12635#true} is VALID [2018-11-23 11:58:02,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {12635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12635#true} is VALID [2018-11-23 11:58:02,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {12635#true} assume true; {12635#true} is VALID [2018-11-23 11:58:02,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12635#true} {12635#true} #139#return; {12635#true} is VALID [2018-11-23 11:58:02,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {12635#true} call #t~ret2 := main(); {12635#true} is VALID [2018-11-23 11:58:02,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {12635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12670#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:02,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {12670#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12638#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:02,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {12638#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:02,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {12639#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:02,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {12640#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12641#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:02,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {12641#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12642#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:02,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {12642#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12643#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:02,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {12643#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12644#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:02,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {12644#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12645#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:02,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {12645#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12646#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:02,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {12646#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12647#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:02,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {12647#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12648#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:02,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {12648#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12649#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:02,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {12649#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12650#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:02,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {12650#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12651#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:02,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {12651#(<= main_~i~0 14)} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 57: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 58: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 59: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 60: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 61: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 62: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 72: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 75: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 78: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 79: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 83: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 84: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 85: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 93: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 96: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 101: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 102: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 104: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 106: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 108: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,268 INFO L273 TraceCheckUtils]: 109: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 110: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 111: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 112: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 113: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 114: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 115: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 116: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {12636#false} ~i~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 121: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 122: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 123: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 124: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 125: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 126: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,270 INFO L273 TraceCheckUtils]: 127: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 128: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 129: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 130: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 131: Hoare triple {12636#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 132: Hoare triple {12636#false} assume !(~i~0 < 100000); {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {12636#false} havoc ~x~0;~x~0 := 0; {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 134: Hoare triple {12636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L256 TraceCheckUtils]: 135: Hoare triple {12636#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {12636#false} is VALID [2018-11-23 11:58:02,271 INFO L273 TraceCheckUtils]: 136: Hoare triple {12636#false} ~cond := #in~cond; {12636#false} is VALID [2018-11-23 11:58:02,272 INFO L273 TraceCheckUtils]: 137: Hoare triple {12636#false} assume 0 == ~cond; {12636#false} is VALID [2018-11-23 11:58:02,272 INFO L273 TraceCheckUtils]: 138: Hoare triple {12636#false} assume !false; {12636#false} is VALID [2018-11-23 11:58:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 11:58:02,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:02,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:58:02,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 11:58:02,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:02,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:02,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:02,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:02,340 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 18 states. [2018-11-23 11:58:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:03,879 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2018-11-23 11:58:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:58:03,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-23 11:58:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2018-11-23 11:58:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2018-11-23 11:58:03,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 200 transitions. [2018-11-23 11:58:04,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:04,101 INFO L225 Difference]: With dead ends: 275 [2018-11-23 11:58:04,101 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:58:04,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:58:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-23 11:58:04,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:04,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 152 states. [2018-11-23 11:58:04,193 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 152 states. [2018-11-23 11:58:04,193 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 152 states. [2018-11-23 11:58:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,195 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 11:58:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 11:58:04,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,196 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 152 states. [2018-11-23 11:58:04,196 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 152 states. [2018-11-23 11:58:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,199 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 11:58:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 11:58:04,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:04,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 11:58:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2018-11-23 11:58:04,203 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 139 [2018-11-23 11:58:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:04,204 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2018-11-23 11:58:04,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:58:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-11-23 11:58:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 11:58:04,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:04,205 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:04,206 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:04,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:04,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1618430950, now seen corresponding path program 15 times [2018-11-23 11:58:04,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:04,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:04,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:04,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:04,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {14178#true} call ULTIMATE.init(); {14178#true} is VALID [2018-11-23 11:58:04,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {14178#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14178#true} is VALID [2018-11-23 11:58:04,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {14178#true} assume true; {14178#true} is VALID [2018-11-23 11:58:04,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14178#true} {14178#true} #139#return; {14178#true} is VALID [2018-11-23 11:58:04,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {14178#true} call #t~ret2 := main(); {14178#true} is VALID [2018-11-23 11:58:04,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {14178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14180#(= main_~i~0 0)} is VALID [2018-11-23 11:58:04,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {14180#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14181#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:04,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {14181#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14182#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:04,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {14182#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14183#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:04,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {14183#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14184#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:04,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {14184#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14185#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:04,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {14185#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14186#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:04,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {14186#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14187#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:04,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {14187#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14188#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:04,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {14188#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14189#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:04,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {14189#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14190#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:04,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {14190#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14191#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:04,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {14191#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14192#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:04,913 INFO L273 TraceCheckUtils]: 18: Hoare triple {14192#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14193#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:04,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {14193#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14194#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:04,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {14194#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14195#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:04,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {14195#(<= main_~i~0 15)} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 41: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 48: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 49: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 52: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 53: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 57: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 59: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 60: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 61: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 62: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 63: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 64: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 65: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 66: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 67: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 68: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 69: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 72: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 73: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 74: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 75: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 76: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 77: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 78: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 79: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 80: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 81: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 82: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 83: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 84: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 87: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 89: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 90: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 91: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 92: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 93: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 95: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 96: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 97: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 98: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 99: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 101: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 103: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 104: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 105: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 106: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 107: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 108: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 110: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 111: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 112: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 113: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 114: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 115: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 116: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 117: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 118: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 119: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 120: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 121: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 122: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 123: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 124: Hoare triple {14179#false} ~i~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 125: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 126: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 127: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 128: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 129: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 130: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 132: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 133: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 134: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 135: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 136: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 137: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 138: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 139: Hoare triple {14179#false} assume !!(~i~0 < 100000);call write~int(49, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 140: Hoare triple {14179#false} assume !(~i~0 < 100000); {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 141: Hoare triple {14179#false} havoc ~x~0;~x~0 := 0; {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 142: Hoare triple {14179#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L256 TraceCheckUtils]: 143: Hoare triple {14179#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {14179#false} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 144: Hoare triple {14179#false} ~cond := #in~cond; {14179#false} is VALID [2018-11-23 11:58:04,932 INFO L273 TraceCheckUtils]: 145: Hoare triple {14179#false} assume 0 == ~cond; {14179#false} is VALID [2018-11-23 11:58:04,932 INFO L273 TraceCheckUtils]: 146: Hoare triple {14179#false} assume !false; {14179#false} is VALID [2018-11-23 11:58:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-23 11:58:04,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:04,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2