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_init6_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:37,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:37,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:37,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:37,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:37,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:37,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:37,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:37,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:37,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:37,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:37,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:37,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:37,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:37,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:37,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:37,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:37,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:37,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:37,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:37,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:37,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:37,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:37,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:37,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:37,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:37,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:37,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:37,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:37,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:37,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:37,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:37,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:37,275 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:37,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:37,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:37,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:37,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:37,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:37,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:37,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:37,303 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:37,303 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:37,303 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:37,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:37,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:37,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:37,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:37,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:37,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:37,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:37,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:37,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:37,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:37,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:37,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:37,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:37,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:37,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:37,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:37,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:37,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:37,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:37,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:37,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:37,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:37,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:37,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:37,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:37,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:37,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:37,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:37,387 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:37,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init6_true-unreach-call_ground.i [2018-11-23 12:02:37,456 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5a60072/4370ae2343e04a8ea6398f8af8b4ff88/FLAGc222b41fa [2018-11-23 12:02:37,935 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:37,936 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init6_true-unreach-call_ground.i [2018-11-23 12:02:37,943 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5a60072/4370ae2343e04a8ea6398f8af8b4ff88/FLAGc222b41fa [2018-11-23 12:02:38,263 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5a60072/4370ae2343e04a8ea6398f8af8b4ff88 [2018-11-23 12:02:38,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:38,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:38,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:38,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:38,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:38,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eca8b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38, skipping insertion in model container [2018-11-23 12:02:38,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:38,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:38,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:38,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:38,671 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:38,703 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:38,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38 WrapperNode [2018-11-23 12:02:38,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:38,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:38,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:38,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:38,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:38,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:38,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:38,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:38,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... [2018-11-23 12:02:38,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:38,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:38,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:38,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:38,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:39,664 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:39,665 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 12:02:39,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:39 BoogieIcfgContainer [2018-11-23 12:02:39,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:39,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:39,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:39,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:39,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:38" (1/3) ... [2018-11-23 12:02:39,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e1ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:39, skipping insertion in model container [2018-11-23 12:02:39,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:38" (2/3) ... [2018-11-23 12:02:39,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e1ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:39, skipping insertion in model container [2018-11-23 12:02:39,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:39" (3/3) ... [2018-11-23 12:02:39,674 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init6_true-unreach-call_ground.i [2018-11-23 12:02:39,685 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:39,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:39,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:39,751 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:39,752 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:39,752 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:39,753 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:39,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:39,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:39,753 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:39,753 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:39,753 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 12:02:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:39,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:39,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1058720290, now seen corresponding path program 1 times [2018-11-23 12:02:39,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 12:02:39,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-23 12:02:39,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:02:39,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #113#return; {36#true} is VALID [2018-11-23 12:02:39,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret2 := main(); {36#true} is VALID [2018-11-23 12:02:39,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {36#true} is VALID [2018-11-23 12:02:39,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 12:02:39,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 12:02:39,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 12:02:39,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 12:02:39,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 12:02:39,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 12:02:39,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-23 12:02:39,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-23 12:02:39,963 INFO L256 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {37#false} is VALID [2018-11-23 12:02:39,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 12:02:39,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-23 12:02:39,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 12:02:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:39,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:39,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:39,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 12:02:39,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:40,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:40,259 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 12:02:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,506 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2018-11-23 12:02:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:40,506 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 12:02:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-23 12:02:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-23 12:02:40,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2018-11-23 12:02:40,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,845 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:02:40,846 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:02:40,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:02:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:02:40,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:40,894 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:40,894 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,899 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:02:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:02:40,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,900 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:40,901 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,905 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:02:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:02:40,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 12:02:40,912 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2018-11-23 12:02:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 12:02:40,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:02:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:40,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,915 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1432039210, now seen corresponding path program 1 times [2018-11-23 12:02:40,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2018-11-23 12:02:41,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {217#true} is VALID [2018-11-23 12:02:41,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-23 12:02:41,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #113#return; {217#true} is VALID [2018-11-23 12:02:41,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret2 := main(); {217#true} is VALID [2018-11-23 12:02:41,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {219#(= main_~i~0 0)} is VALID [2018-11-23 12:02:41,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {219#(= main_~i~0 0)} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 12:02:41,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {218#false} havoc ~x~0;~x~0 := 0; {218#false} is VALID [2018-11-23 12:02:41,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {218#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {218#false} is VALID [2018-11-23 12:02:41,021 INFO L256 TraceCheckUtils]: 19: Hoare triple {218#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {218#false} is VALID [2018-11-23 12:02:41,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2018-11-23 12:02:41,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2018-11-23 12:02:41,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {218#false} assume !false; {218#false} is VALID [2018-11-23 12:02:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:41,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:41,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:41,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:02:41,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:41,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:41,084 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2018-11-23 12:02:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,680 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 12:02:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:41,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:02:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:02:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:02:41,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:02:41,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,873 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:02:41,873 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:02:41,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:02:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:02:41,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:41,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:41,912 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:41,912 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,916 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:02:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:02:41,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,917 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:41,917 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,920 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:02:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:02:41,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:41,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:02:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 12:02:41,925 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 12:02:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:41,925 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 12:02:41,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:02:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:41,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:41,927 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] [2018-11-23 12:02:41,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:41,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2002754829, now seen corresponding path program 1 times [2018-11-23 12:02:41,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:41,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-23 12:02:42,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {425#true} is VALID [2018-11-23 12:02:42,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-23 12:02:42,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #113#return; {425#true} is VALID [2018-11-23 12:02:42,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2018-11-23 12:02:42,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {427#(= main_~i~0 0)} is VALID [2018-11-23 12:02:42,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#(= 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; {428#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(<= main_~i~0 1)} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {426#false} havoc ~x~0;~x~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {426#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {426#false} is VALID [2018-11-23 12:02:42,087 INFO L256 TraceCheckUtils]: 25: Hoare triple {426#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {426#false} is VALID [2018-11-23 12:02:42,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {426#false} ~cond := #in~cond; {426#false} is VALID [2018-11-23 12:02:42,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {426#false} assume 0 == ~cond; {426#false} is VALID [2018-11-23 12:02:42,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-23 12:02:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:02:42,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:42,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:42,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-23 12:02:42,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {425#true} is VALID [2018-11-23 12:02:42,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-23 12:02:42,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #113#return; {425#true} is VALID [2018-11-23 12:02:42,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2018-11-23 12:02:42,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {447#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:42,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(<= 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; {428#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(<= main_~i~0 1)} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 12:02:42,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 12:02:42,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {426#false} havoc ~x~0;~x~0 := 0; {426#false} is VALID [2018-11-23 12:02:42,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {426#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {426#false} is VALID [2018-11-23 12:02:42,486 INFO L256 TraceCheckUtils]: 25: Hoare triple {426#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {426#false} is VALID [2018-11-23 12:02:42,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {426#false} ~cond := #in~cond; {426#false} is VALID [2018-11-23 12:02:42,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {426#false} assume 0 == ~cond; {426#false} is VALID [2018-11-23 12:02:42,487 INFO L273 TraceCheckUtils]: 28: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-23 12:02:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:02:42,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:42,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:42,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:02:42,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:42,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:42,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:42,638 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2018-11-23 12:02:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,142 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-23 12:02:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:43,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:02:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 12:02:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 12:02:43,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-23 12:02:43,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,326 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:02:43,327 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:43,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:43,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:43,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:43,396 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,400 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:02:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:02:43,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,401 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:43,401 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,404 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 12:02:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:02:43,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:43,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 12:02:43,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 29 [2018-11-23 12:02:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:43,409 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 12:02:43,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:02:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:43,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:43,410 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:43,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:43,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1979990410, now seen corresponding path program 2 times [2018-11-23 12:02:43,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:43,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 12:02:43,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 12:02:43,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #113#return; {765#true} is VALID [2018-11-23 12:02:43,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 12:02:43,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {767#(= main_~i~0 0)} is VALID [2018-11-23 12:02:43,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(= 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; {768#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= 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; {769#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= main_~i~0 2)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,569 INFO L273 TraceCheckUtils]: 19: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 12:02:43,572 INFO L256 TraceCheckUtils]: 31: Hoare triple {766#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 12:02:43,572 INFO L273 TraceCheckUtils]: 32: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 12:02:43,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 12:02:43,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 12:02:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:02:43,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:43,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:43,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:43,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 12:02:43,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 12:02:43,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 12:02:43,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #113#return; {765#true} is VALID [2018-11-23 12:02:43,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 12:02:43,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {765#true} is VALID [2018-11-23 12:02:43,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 12:02:43,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {765#true} ~i~0 := 0; {765#true} is VALID [2018-11-23 12:02:43,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 12:02:43,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#true} ~i~0 := 0; {765#true} is VALID [2018-11-23 12:02:43,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 12:02:43,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 12:02:43,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {765#true} ~i~0 := 0; {824#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:43,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {768#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {768#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {769#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {769#(<= main_~i~0 2)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,814 INFO L273 TraceCheckUtils]: 27: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 12:02:43,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:43,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 12:02:43,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 12:02:43,815 INFO L256 TraceCheckUtils]: 31: Hoare triple {766#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 12:02:43,815 INFO L273 TraceCheckUtils]: 32: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 12:02:43,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 12:02:43,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 12:02:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:02:43,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:43,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 12:02:43,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:43,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:43,895 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 6 states. [2018-11-23 12:02:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,250 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-11-23 12:02:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:44,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 12:02:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:02:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:02:44,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 12:02:44,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,391 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:02:44,391 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:02:44,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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 12:02:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:02:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:02:44,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:44,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:44,444 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:44,444 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,448 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:02:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:02:44,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,449 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:44,449 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,451 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:02:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:02:44,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:44,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:02:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 12:02:44,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2018-11-23 12:02:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 12:02:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:02:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:02:44,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,458 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:44,458 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 682352339, now seen corresponding path program 3 times [2018-11-23 12:02:44,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:44,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-23 12:02:44,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1170#true} is VALID [2018-11-23 12:02:44,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-23 12:02:44,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #113#return; {1170#true} is VALID [2018-11-23 12:02:44,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-23 12:02:44,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {1170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1172#(= main_~i~0 0)} is VALID [2018-11-23 12:02:44,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(= 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; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(<= 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; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(<= 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; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {1175#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 12:02:44,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,648 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} havoc ~x~0;~x~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {1171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1171#false} is VALID [2018-11-23 12:02:44,648 INFO L256 TraceCheckUtils]: 37: Hoare triple {1171#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1171#false} is VALID [2018-11-23 12:02:44,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-23 12:02:44,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2018-11-23 12:02:44,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-23 12:02:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:02:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:44,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:44,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:44,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-23 12:02:44,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1170#true} is VALID [2018-11-23 12:02:44,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-23 12:02:44,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #113#return; {1170#true} is VALID [2018-11-23 12:02:44,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-23 12:02:44,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {1170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1170#true} is VALID [2018-11-23 12:02:44,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 12:02:44,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 12:02:44,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 12:02:44,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 12:02:44,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 12:02:44,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 12:02:44,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 12:02:44,885 INFO L273 TraceCheckUtils]: 25: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 12:02:44,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,886 INFO L273 TraceCheckUtils]: 28: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 12:02:44,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 12:02:44,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {1170#true} ~i~0 := 0; {1269#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {1269#(<= 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; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {1173#(<= 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; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {1174#(<= 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; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {1175#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 12:02:44,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} havoc ~x~0;~x~0 := 0; {1171#false} is VALID [2018-11-23 12:02:44,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {1171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1171#false} is VALID [2018-11-23 12:02:44,901 INFO L256 TraceCheckUtils]: 37: Hoare triple {1171#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1171#false} is VALID [2018-11-23 12:02:44,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-23 12:02:44,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2018-11-23 12:02:44,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-23 12:02:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:02:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:44,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:02:44,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:45,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:45,007 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 7 states. [2018-11-23 12:02:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,408 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 12:02:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:45,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:02:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 12:02:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 12:02:45,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-23 12:02:45,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,592 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:02:45,592 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:02:45,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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 12:02:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:02:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:02:45,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:45,640 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:45,641 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,643 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 12:02:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 12:02:45,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,644 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:45,645 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,647 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 12:02:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 12:02:45,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 12:02:45,652 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 41 [2018-11-23 12:02:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,652 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 12:02:45,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 12:02:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:45,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,654 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:45,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash -411261930, now seen corresponding path program 4 times [2018-11-23 12:02:45,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 12:02:45,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 12:02:45,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 12:02:45,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #113#return; {1640#true} is VALID [2018-11-23 12:02:45,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret2 := main(); {1640#true} is VALID [2018-11-23 12:02:45,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1642#(= main_~i~0 0)} is VALID [2018-11-23 12:02:45,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {1642#(= 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; {1643#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(<= 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; {1644#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {1644#(<= 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; {1645#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(<= 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; {1646#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:45,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {1646#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:45,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:45,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {1641#false} havoc ~x~0;~x~0 := 0; {1641#false} is VALID [2018-11-23 12:02:45,844 INFO L273 TraceCheckUtils]: 42: Hoare triple {1641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 12:02:45,845 INFO L256 TraceCheckUtils]: 43: Hoare triple {1641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1641#false} is VALID [2018-11-23 12:02:45,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 12:02:45,845 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 12:02:45,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 12:02:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 12:02:45,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:45,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:45,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:45,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:45,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 12:02:46,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 12:02:46,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 12:02:46,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #113#return; {1640#true} is VALID [2018-11-23 12:02:46,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret2 := main(); {1640#true} is VALID [2018-11-23 12:02:46,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1665#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:46,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {1665#(<= 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; {1643#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(<= 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; {1644#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {1644#(<= 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; {1645#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(<= 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; {1646#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {1646#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {1641#false} havoc ~x~0;~x~0 := 0; {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {1641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L256 TraceCheckUtils]: 43: Hoare triple {1641#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 12:02:46,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 12:02:46,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 12:02:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 12:02:46,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:46,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:02:46,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:46,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:46,405 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2018-11-23 12:02:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,972 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2018-11-23 12:02:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:46,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:02:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 12:02:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 12:02:46,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2018-11-23 12:02:47,183 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 12:02:47,186 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:02:47,186 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:02:47,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 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 12:02:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:02:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:02:47,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:47,274 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:47,274 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,277 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 12:02:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 12:02:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,278 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:47,278 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,281 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 12:02:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 12:02:47,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:02:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 12:02:47,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 47 [2018-11-23 12:02:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,285 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 12:02:47,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 12:02:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:02:47,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,287 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:47,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1179573581, now seen corresponding path program 5 times [2018-11-23 12:02:47,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {2175#true} call ULTIMATE.init(); {2175#true} is VALID [2018-11-23 12:02:47,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {2175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2175#true} is VALID [2018-11-23 12:02:47,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {2175#true} assume true; {2175#true} is VALID [2018-11-23 12:02:47,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2175#true} {2175#true} #113#return; {2175#true} is VALID [2018-11-23 12:02:47,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {2175#true} call #t~ret2 := main(); {2175#true} is VALID [2018-11-23 12:02:47,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {2175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2177#(= main_~i~0 0)} is VALID [2018-11-23 12:02:47,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {2177#(= 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; {2178#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {2178#(<= 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; {2179#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {2179#(<= 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; {2180#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:47,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {2180#(<= 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; {2181#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:47,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {2181#(<= 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; {2182#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:47,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {2182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 25: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:47,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:47,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {2176#false} havoc ~x~0;~x~0 := 0; {2176#false} is VALID [2018-11-23 12:02:47,526 INFO L273 TraceCheckUtils]: 48: Hoare triple {2176#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2176#false} is VALID [2018-11-23 12:02:47,526 INFO L256 TraceCheckUtils]: 49: Hoare triple {2176#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2176#false} is VALID [2018-11-23 12:02:47,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {2176#false} ~cond := #in~cond; {2176#false} is VALID [2018-11-23 12:02:47,530 INFO L273 TraceCheckUtils]: 51: Hoare triple {2176#false} assume 0 == ~cond; {2176#false} is VALID [2018-11-23 12:02:47,530 INFO L273 TraceCheckUtils]: 52: Hoare triple {2176#false} assume !false; {2176#false} is VALID [2018-11-23 12:02:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 12:02:47,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:47,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:47,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:52,071 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:52,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:52,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:52,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {2175#true} call ULTIMATE.init(); {2175#true} is VALID [2018-11-23 12:02:52,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {2175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2175#true} is VALID [2018-11-23 12:02:52,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {2175#true} assume true; {2175#true} is VALID [2018-11-23 12:02:52,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2175#true} {2175#true} #113#return; {2175#true} is VALID [2018-11-23 12:02:52,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {2175#true} call #t~ret2 := main(); {2175#true} is VALID [2018-11-23 12:02:52,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {2175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2175#true} is VALID [2018-11-23 12:02:52,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 12:02:52,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 12:02:52,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 12:02:52,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {2175#true} ~i~0 := 0; {2285#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:52,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {2285#(<= 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; {2178#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:52,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {2178#(<= 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; {2179#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:52,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {2179#(<= 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; {2180#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:52,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {2180#(<= 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; {2181#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:52,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {2181#(<= 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; {2182#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:52,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {2182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:52,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 12:02:52,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:52,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:52,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:52,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:52,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 12:02:52,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 12:02:52,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {2176#false} havoc ~x~0;~x~0 := 0; {2176#false} is VALID [2018-11-23 12:02:52,375 INFO L273 TraceCheckUtils]: 48: Hoare triple {2176#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2176#false} is VALID [2018-11-23 12:02:52,375 INFO L256 TraceCheckUtils]: 49: Hoare triple {2176#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2176#false} is VALID [2018-11-23 12:02:52,375 INFO L273 TraceCheckUtils]: 50: Hoare triple {2176#false} ~cond := #in~cond; {2176#false} is VALID [2018-11-23 12:02:52,376 INFO L273 TraceCheckUtils]: 51: Hoare triple {2176#false} assume 0 == ~cond; {2176#false} is VALID [2018-11-23 12:02:52,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {2176#false} assume !false; {2176#false} is VALID [2018-11-23 12:02:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 12:02:52,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:52,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:52,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-23 12:02:52,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:52,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:52,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:52,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:52,464 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-11-23 12:02:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,831 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-11-23 12:02:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:52,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-23 12:02:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-23 12:02:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-23 12:02:52,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2018-11-23 12:02:52,946 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 12:02:52,948 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:02:52,948 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:02:52,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:02:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:02:53,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:53,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:53,078 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:53,078 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:53,081 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:02:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:02:53,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:53,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:53,082 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:53,082 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:53,084 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 12:02:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:02:53,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:53,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:53,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:53,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:02:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-23 12:02:53,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-11-23 12:02:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:53,087 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-23 12:02:53,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 12:02:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:02:53,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:53,089 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:53,089 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:53,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1766162870, now seen corresponding path program 6 times [2018-11-23 12:02:53,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:53,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:53,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2018-11-23 12:02:53,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2775#true} is VALID [2018-11-23 12:02:53,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2018-11-23 12:02:53,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #113#return; {2775#true} is VALID [2018-11-23 12:02:53,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret2 := main(); {2775#true} is VALID [2018-11-23 12:02:53,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {2775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2777#(= main_~i~0 0)} is VALID [2018-11-23 12:02:53,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {2777#(= 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; {2778#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:53,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {2778#(<= 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; {2779#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:53,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {2779#(<= 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; {2780#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:53,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {2780#(<= 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; {2781#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:53,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {2781#(<= 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; {2782#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:53,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {2783#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,525 INFO L273 TraceCheckUtils]: 29: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,525 INFO L273 TraceCheckUtils]: 31: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,527 INFO L273 TraceCheckUtils]: 38: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,528 INFO L273 TraceCheckUtils]: 43: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,528 INFO L273 TraceCheckUtils]: 44: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,529 INFO L273 TraceCheckUtils]: 47: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,529 INFO L273 TraceCheckUtils]: 48: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,530 INFO L273 TraceCheckUtils]: 50: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,530 INFO L273 TraceCheckUtils]: 51: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:53,530 INFO L273 TraceCheckUtils]: 52: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:53,531 INFO L273 TraceCheckUtils]: 53: Hoare triple {2776#false} havoc ~x~0;~x~0 := 0; {2776#false} is VALID [2018-11-23 12:02:53,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {2776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2776#false} is VALID [2018-11-23 12:02:53,531 INFO L256 TraceCheckUtils]: 55: Hoare triple {2776#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2776#false} is VALID [2018-11-23 12:02:53,531 INFO L273 TraceCheckUtils]: 56: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2018-11-23 12:02:53,532 INFO L273 TraceCheckUtils]: 57: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2018-11-23 12:02:53,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2018-11-23 12:02:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:02:53,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:53,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:53,551 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:54,389 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:54,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:54,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:54,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2018-11-23 12:02:54,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2775#true} is VALID [2018-11-23 12:02:54,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2018-11-23 12:02:54,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #113#return; {2775#true} is VALID [2018-11-23 12:02:54,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret2 := main(); {2775#true} is VALID [2018-11-23 12:02:54,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {2775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2802#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:54,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {2802#(<= 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; {2778#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:54,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {2778#(<= 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; {2779#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:54,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {2779#(<= 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; {2780#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:54,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {2780#(<= 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; {2781#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:54,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {2781#(<= 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; {2782#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:54,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:54,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2783#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L273 TraceCheckUtils]: 53: Hoare triple {2776#false} havoc ~x~0;~x~0 := 0; {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {2776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L256 TraceCheckUtils]: 55: Hoare triple {2776#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {2776#false} is VALID [2018-11-23 12:02:54,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2018-11-23 12:02:54,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2018-11-23 12:02:54,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2018-11-23 12:02:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 12:02:54,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:54,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:54,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-23 12:02:54,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:54,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:54,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:54,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:54,710 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 10 states. [2018-11-23 12:02:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,443 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-11-23 12:02:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:55,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-23 12:02:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-23 12:02:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-23 12:02:55,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-23 12:02:55,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:55,630 INFO L225 Difference]: With dead ends: 121 [2018-11-23 12:02:55,631 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:02:55,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:02:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 12:02:55,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:55,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:55,692 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:55,692 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,696 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 12:02:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 12:02:55,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:55,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:55,696 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:55,697 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:02:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,699 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 12:02:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 12:02:55,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:55,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:55,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:55,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:02:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-23 12:02:55,701 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 59 [2018-11-23 12:02:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:55,702 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-23 12:02:55,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 12:02:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:02:55,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:55,703 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:55,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:55,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 728903315, now seen corresponding path program 7 times [2018-11-23 12:02:55,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:55,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:55,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:55,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2018-11-23 12:02:55,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3440#true} is VALID [2018-11-23 12:02:55,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2018-11-23 12:02:55,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #113#return; {3440#true} is VALID [2018-11-23 12:02:55,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret2 := main(); {3440#true} is VALID [2018-11-23 12:02:55,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {3440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3442#(= main_~i~0 0)} is VALID [2018-11-23 12:02:55,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {3442#(= 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; {3443#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:55,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {3443#(<= 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; {3444#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:55,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#(<= 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; {3445#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:55,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {3445#(<= 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; {3446#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:55,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {3446#(<= 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; {3447#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:55,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {3447#(<= 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; {3448#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:55,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(<= 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; {3449#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:55,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {3449#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 44: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 47: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 50: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 51: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 52: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 53: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,932 INFO L273 TraceCheckUtils]: 54: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 55: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 59: Hoare triple {3441#false} havoc ~x~0;~x~0 := 0; {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {3441#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L256 TraceCheckUtils]: 61: Hoare triple {3441#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3441#false} is VALID [2018-11-23 12:02:55,933 INFO L273 TraceCheckUtils]: 62: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2018-11-23 12:02:55,934 INFO L273 TraceCheckUtils]: 63: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2018-11-23 12:02:55,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2018-11-23 12:02:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 12:02:55,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:55,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:55,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:56,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:56,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2018-11-23 12:02:56,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3440#true} is VALID [2018-11-23 12:02:56,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2018-11-23 12:02:56,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #113#return; {3440#true} is VALID [2018-11-23 12:02:56,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret2 := main(); {3440#true} is VALID [2018-11-23 12:02:56,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {3440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3468#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:56,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {3468#(<= 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; {3443#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:56,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {3443#(<= 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; {3444#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:56,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#(<= 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; {3445#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:56,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {3445#(<= 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; {3446#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:56,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {3446#(<= 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; {3447#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:56,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {3447#(<= 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; {3448#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:56,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(<= 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; {3449#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:56,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {3449#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 40: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,276 INFO L273 TraceCheckUtils]: 41: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,277 INFO L273 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 51: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,278 INFO L273 TraceCheckUtils]: 52: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 53: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 54: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 55: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 56: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 12:02:56,279 INFO L273 TraceCheckUtils]: 58: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 12:02:56,280 INFO L273 TraceCheckUtils]: 59: Hoare triple {3441#false} havoc ~x~0;~x~0 := 0; {3441#false} is VALID [2018-11-23 12:02:56,280 INFO L273 TraceCheckUtils]: 60: Hoare triple {3441#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3441#false} is VALID [2018-11-23 12:02:56,280 INFO L256 TraceCheckUtils]: 61: Hoare triple {3441#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {3441#false} is VALID [2018-11-23 12:02:56,280 INFO L273 TraceCheckUtils]: 62: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2018-11-23 12:02:56,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2018-11-23 12:02:56,281 INFO L273 TraceCheckUtils]: 64: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2018-11-23 12:02:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 12:02:56,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:56,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:56,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-23 12:02:56,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:56,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:56,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:56,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:56,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:56,397 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 11 states. [2018-11-23 12:02:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:56,892 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-11-23 12:02:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:56,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-23 12:02:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2018-11-23 12:02:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2018-11-23 12:02:56,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2018-11-23 12:02:57,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:57,039 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:02:57,039 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:02:57,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:02:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 12:02:57,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:57,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:57,091 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:57,091 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:57,093 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 12:02:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 12:02:57,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:57,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:57,094 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:57,094 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:02:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:57,097 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 12:02:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 12:02:57,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:57,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:57,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:57,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:02:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-23 12:02:57,100 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 65 [2018-11-23 12:02:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:57,100 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-23 12:02:57,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 12:02:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:02:57,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:57,104 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:57,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:57,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash -688629930, now seen corresponding path program 8 times [2018-11-23 12:02:57,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:57,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {4170#true} call ULTIMATE.init(); {4170#true} is VALID [2018-11-23 12:02:57,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {4170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4170#true} is VALID [2018-11-23 12:02:57,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {4170#true} assume true; {4170#true} is VALID [2018-11-23 12:02:57,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4170#true} {4170#true} #113#return; {4170#true} is VALID [2018-11-23 12:02:57,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {4170#true} call #t~ret2 := main(); {4170#true} is VALID [2018-11-23 12:02:57,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {4170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4172#(= main_~i~0 0)} is VALID [2018-11-23 12:02:57,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {4172#(= 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; {4173#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:57,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {4173#(<= 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; {4174#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:57,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= 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; {4175#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:57,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {4175#(<= 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; {4176#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:57,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {4176#(<= 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; {4177#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:57,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {4177#(<= 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; {4178#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:57,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {4178#(<= 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; {4179#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:57,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {4179#(<= 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; {4180#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:57,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {4180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 35: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 48: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,470 INFO L273 TraceCheckUtils]: 49: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 56: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,471 INFO L273 TraceCheckUtils]: 57: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 60: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 61: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 62: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {4171#false} havoc ~x~0;~x~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {4171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4171#false} is VALID [2018-11-23 12:02:57,473 INFO L256 TraceCheckUtils]: 67: Hoare triple {4171#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4171#false} is VALID [2018-11-23 12:02:57,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {4171#false} ~cond := #in~cond; {4171#false} is VALID [2018-11-23 12:02:57,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {4171#false} assume 0 == ~cond; {4171#false} is VALID [2018-11-23 12:02:57,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {4171#false} assume !false; {4171#false} is VALID [2018-11-23 12:02:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 12:02:57,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:57,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:57,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:57,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:57,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:57,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:57,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {4170#true} call ULTIMATE.init(); {4170#true} is VALID [2018-11-23 12:02:57,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {4170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4170#true} is VALID [2018-11-23 12:02:57,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {4170#true} assume true; {4170#true} is VALID [2018-11-23 12:02:57,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4170#true} {4170#true} #113#return; {4170#true} is VALID [2018-11-23 12:02:57,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {4170#true} call #t~ret2 := main(); {4170#true} is VALID [2018-11-23 12:02:57,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {4170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4199#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:57,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {4199#(<= 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; {4173#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:57,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {4173#(<= 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; {4174#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:57,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= 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; {4175#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:57,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {4175#(<= 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; {4176#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:57,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {4176#(<= 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; {4177#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:57,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {4177#(<= 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; {4178#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:57,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {4178#(<= 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; {4179#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:57,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {4179#(<= 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; {4180#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {4180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 46: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,822 INFO L273 TraceCheckUtils]: 53: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 58: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,823 INFO L273 TraceCheckUtils]: 61: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 63: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 65: Hoare triple {4171#false} havoc ~x~0;~x~0 := 0; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {4171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L256 TraceCheckUtils]: 67: Hoare triple {4171#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 68: Hoare triple {4171#false} ~cond := #in~cond; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 69: Hoare triple {4171#false} assume 0 == ~cond; {4171#false} is VALID [2018-11-23 12:02:57,824 INFO L273 TraceCheckUtils]: 70: Hoare triple {4171#false} assume !false; {4171#false} is VALID [2018-11-23 12:02:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 12:02:57,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:57,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:57,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 12:02:57,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:57,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:57,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:57,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:57,884 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 12 states. [2018-11-23 12:02:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,520 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-11-23 12:02:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:58,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 12:02:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2018-11-23 12:02:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2018-11-23 12:02:58,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 120 transitions. [2018-11-23 12:02:58,729 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 12:02:58,732 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:02:58,732 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:02:58,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:02:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 12:02:58,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:58,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 12:02:58,796 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 12:02:58,796 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 12:02:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,798 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 12:02:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 12:02:58,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:58,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:58,799 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 12:02:58,799 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 12:02:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,800 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 12:02:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 12:02:58,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:58,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:58,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:58,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:02:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 12:02:58,803 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 71 [2018-11-23 12:02:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 12:02:58,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 12:02:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:02:58,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:58,805 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:02:58,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:58,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1278280307, now seen corresponding path program 9 times [2018-11-23 12:02:58,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:58,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:59,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2018-11-23 12:02:59,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {4965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4965#true} is VALID [2018-11-23 12:02:59,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2018-11-23 12:02:59,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #113#return; {4965#true} is VALID [2018-11-23 12:02:59,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret2 := main(); {4965#true} is VALID [2018-11-23 12:02:59,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {4965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4967#(= main_~i~0 0)} is VALID [2018-11-23 12:02:59,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {4967#(= 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; {4968#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:59,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {4968#(<= 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; {4969#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:59,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {4969#(<= 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; {4970#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:59,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {4970#(<= 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; {4971#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:59,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {4971#(<= 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; {4972#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:59,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {4972#(<= 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; {4973#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:59,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {4973#(<= 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; {4974#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:59,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:59,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:59,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {4976#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,097 INFO L273 TraceCheckUtils]: 37: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,100 INFO L273 TraceCheckUtils]: 51: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,101 INFO L273 TraceCheckUtils]: 53: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,101 INFO L273 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,101 INFO L273 TraceCheckUtils]: 55: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,101 INFO L273 TraceCheckUtils]: 56: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,102 INFO L273 TraceCheckUtils]: 57: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,102 INFO L273 TraceCheckUtils]: 60: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,102 INFO L273 TraceCheckUtils]: 61: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,103 INFO L273 TraceCheckUtils]: 64: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,103 INFO L273 TraceCheckUtils]: 65: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,103 INFO L273 TraceCheckUtils]: 66: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,104 INFO L273 TraceCheckUtils]: 67: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,104 INFO L273 TraceCheckUtils]: 68: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,104 INFO L273 TraceCheckUtils]: 69: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:02:59,104 INFO L273 TraceCheckUtils]: 70: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:02:59,104 INFO L273 TraceCheckUtils]: 71: Hoare triple {4966#false} havoc ~x~0;~x~0 := 0; {4966#false} is VALID [2018-11-23 12:02:59,105 INFO L273 TraceCheckUtils]: 72: Hoare triple {4966#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4966#false} is VALID [2018-11-23 12:02:59,105 INFO L256 TraceCheckUtils]: 73: Hoare triple {4966#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4966#false} is VALID [2018-11-23 12:02:59,105 INFO L273 TraceCheckUtils]: 74: Hoare triple {4966#false} ~cond := #in~cond; {4966#false} is VALID [2018-11-23 12:02:59,105 INFO L273 TraceCheckUtils]: 75: Hoare triple {4966#false} assume 0 == ~cond; {4966#false} is VALID [2018-11-23 12:02:59,105 INFO L273 TraceCheckUtils]: 76: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2018-11-23 12:02:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:02:59,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:59,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:10,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:03:10,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:10,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2018-11-23 12:03:10,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {4965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4965#true} is VALID [2018-11-23 12:03:10,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2018-11-23 12:03:10,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #113#return; {4965#true} is VALID [2018-11-23 12:03:10,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret2 := main(); {4965#true} is VALID [2018-11-23 12:03:10,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {4965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4965#true} is VALID [2018-11-23 12:03:10,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {4965#true} assume !(~i~0 < 100000); {4965#true} is VALID [2018-11-23 12:03:10,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {4965#true} ~i~0 := 0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,287 INFO L273 TraceCheckUtils]: 25: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 12:03:10,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {4965#true} assume !(~i~0 < 100000); {4965#true} is VALID [2018-11-23 12:03:10,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {4965#true} ~i~0 := 0; {5061#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:10,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {5061#(<= 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; {4968#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:10,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= 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; {4969#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:10,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= 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; {4970#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:10,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {4970#(<= 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; {4971#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:10,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {4971#(<= 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; {4972#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:10,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {4972#(<= 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; {4973#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:10,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {4973#(<= 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; {4974#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:10,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:10,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:10,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {4976#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:03:10,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:03:10,295 INFO L273 TraceCheckUtils]: 39: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,296 INFO L273 TraceCheckUtils]: 41: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,296 INFO L273 TraceCheckUtils]: 44: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,297 INFO L273 TraceCheckUtils]: 46: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,297 INFO L273 TraceCheckUtils]: 47: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:03:10,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:03:10,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,298 INFO L273 TraceCheckUtils]: 52: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 55: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 56: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 59: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:03:10,299 INFO L273 TraceCheckUtils]: 60: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 61: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 62: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 63: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 64: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 65: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 66: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 67: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 68: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,300 INFO L273 TraceCheckUtils]: 69: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 70: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 71: Hoare triple {4966#false} havoc ~x~0;~x~0 := 0; {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 72: Hoare triple {4966#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L256 TraceCheckUtils]: 73: Hoare triple {4966#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 74: Hoare triple {4966#false} ~cond := #in~cond; {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 75: Hoare triple {4966#false} assume 0 == ~cond; {4966#false} is VALID [2018-11-23 12:03:10,301 INFO L273 TraceCheckUtils]: 76: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2018-11-23 12:03:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:03:10,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:03:10,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-11-23 12:03:10,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:10,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:03:10,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:10,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:03:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:03:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:10,384 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 13 states. [2018-11-23 12:03:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:10,823 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-11-23 12:03:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:03:10,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-11-23 12:03:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2018-11-23 12:03:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2018-11-23 12:03:10,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2018-11-23 12:03:11,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:11,888 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:03:11,888 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:03:11,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:03:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 12:03:11,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:11,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:11,948 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:11,948 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,950 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 12:03:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 12:03:11,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:11,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:11,951 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:11,951 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,953 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 12:03:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 12:03:11,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:11,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:11,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:11,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:03:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-11-23 12:03:11,955 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 77 [2018-11-23 12:03:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-11-23 12:03:11,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:03:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 12:03:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:03:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:11,956 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:11,956 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:11,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash -106486538, now seen corresponding path program 10 times [2018-11-23 12:03:11,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:11,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {5825#true} call ULTIMATE.init(); {5825#true} is VALID [2018-11-23 12:03:12,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {5825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5825#true} is VALID [2018-11-23 12:03:12,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {5825#true} assume true; {5825#true} is VALID [2018-11-23 12:03:12,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5825#true} {5825#true} #113#return; {5825#true} is VALID [2018-11-23 12:03:12,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {5825#true} call #t~ret2 := main(); {5825#true} is VALID [2018-11-23 12:03:12,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {5825#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5827#(= main_~i~0 0)} is VALID [2018-11-23 12:03:12,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {5827#(= 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; {5828#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {5828#(<= 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; {5829#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {5829#(<= 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; {5830#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {5830#(<= 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; {5831#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {5831#(<= 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; {5832#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {5832#(<= 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; {5833#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {5833#(<= 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; {5834#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:12,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {5834#(<= 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; {5835#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:12,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {5835#(<= 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; {5836#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:12,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {5836#(<= 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; {5837#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:12,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {5837#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,644 INFO L273 TraceCheckUtils]: 27: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,645 INFO L273 TraceCheckUtils]: 29: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,645 INFO L273 TraceCheckUtils]: 30: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 45: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 59: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,649 INFO L273 TraceCheckUtils]: 60: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 61: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 62: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 63: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 64: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 66: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 67: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,650 INFO L273 TraceCheckUtils]: 68: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 69: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 70: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 71: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 72: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 73: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 75: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,651 INFO L273 TraceCheckUtils]: 76: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L273 TraceCheckUtils]: 77: Hoare triple {5826#false} havoc ~x~0;~x~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L273 TraceCheckUtils]: 78: Hoare triple {5826#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L256 TraceCheckUtils]: 79: Hoare triple {5826#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L273 TraceCheckUtils]: 80: Hoare triple {5826#false} ~cond := #in~cond; {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L273 TraceCheckUtils]: 81: Hoare triple {5826#false} assume 0 == ~cond; {5826#false} is VALID [2018-11-23 12:03:12,652 INFO L273 TraceCheckUtils]: 82: Hoare triple {5826#false} assume !false; {5826#false} is VALID [2018-11-23 12:03:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-23 12:03:12,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:12,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:12,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:12,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:12,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:12,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {5825#true} call ULTIMATE.init(); {5825#true} is VALID [2018-11-23 12:03:12,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {5825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5825#true} is VALID [2018-11-23 12:03:12,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {5825#true} assume true; {5825#true} is VALID [2018-11-23 12:03:12,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5825#true} {5825#true} #113#return; {5825#true} is VALID [2018-11-23 12:03:12,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {5825#true} call #t~ret2 := main(); {5825#true} is VALID [2018-11-23 12:03:12,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {5825#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5856#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:12,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {5856#(<= 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; {5828#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {5828#(<= 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; {5829#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {5829#(<= 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; {5830#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {5830#(<= 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; {5831#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {5831#(<= 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; {5832#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {5832#(<= 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; {5833#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {5833#(<= 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; {5834#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:12,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {5834#(<= 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; {5835#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:12,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {5835#(<= 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; {5836#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:12,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {5836#(<= 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; {5837#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:12,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {5837#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,959 INFO L273 TraceCheckUtils]: 27: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 33: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 34: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 42: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 46: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 47: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 48: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 49: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 50: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,962 INFO L273 TraceCheckUtils]: 51: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 53: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 54: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 55: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 56: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 57: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 58: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,963 INFO L273 TraceCheckUtils]: 60: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 61: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 62: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 63: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 64: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 65: Hoare triple {5826#false} ~i~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 66: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 67: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,964 INFO L273 TraceCheckUtils]: 68: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 69: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 70: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 71: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 72: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 73: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 74: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 75: Hoare triple {5826#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 76: Hoare triple {5826#false} assume !(~i~0 < 100000); {5826#false} is VALID [2018-11-23 12:03:12,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {5826#false} havoc ~x~0;~x~0 := 0; {5826#false} is VALID [2018-11-23 12:03:12,966 INFO L273 TraceCheckUtils]: 78: Hoare triple {5826#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5826#false} is VALID [2018-11-23 12:03:12,966 INFO L256 TraceCheckUtils]: 79: Hoare triple {5826#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {5826#false} is VALID [2018-11-23 12:03:12,966 INFO L273 TraceCheckUtils]: 80: Hoare triple {5826#false} ~cond := #in~cond; {5826#false} is VALID [2018-11-23 12:03:12,966 INFO L273 TraceCheckUtils]: 81: Hoare triple {5826#false} assume 0 == ~cond; {5826#false} is VALID [2018-11-23 12:03:12,966 INFO L273 TraceCheckUtils]: 82: Hoare triple {5826#false} assume !false; {5826#false} is VALID [2018-11-23 12:03:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-23 12:03:12,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:12,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:03:12,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-23 12:03:12,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:12,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:03:13,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:13,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:03:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:03:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:13,022 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 14 states. [2018-11-23 12:03:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,064 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-11-23 12:03:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:03:14,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-23 12:03:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2018-11-23 12:03:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2018-11-23 12:03:14,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 132 transitions. [2018-11-23 12:03:14,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:14,685 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:03:14,685 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:03:14,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:03:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-23 12:03:14,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:14,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 94 states. [2018-11-23 12:03:14,900 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 12:03:14,900 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 12:03:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,905 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 12:03:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 12:03:14,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:14,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:14,906 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 12:03:14,906 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 12:03:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,908 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 12:03:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 12:03:14,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:14,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:14,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:14,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:03:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-11-23 12:03:14,911 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 83 [2018-11-23 12:03:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:14,911 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-11-23 12:03:14,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:03:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 12:03:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:03:14,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:14,912 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:14,913 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:14,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -391143853, now seen corresponding path program 11 times [2018-11-23 12:03:14,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:14,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2018-11-23 12:03:15,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6750#true} is VALID [2018-11-23 12:03:15,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2018-11-23 12:03:15,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #113#return; {6750#true} is VALID [2018-11-23 12:03:15,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret2 := main(); {6750#true} is VALID [2018-11-23 12:03:15,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {6750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6752#(= main_~i~0 0)} is VALID [2018-11-23 12:03:15,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {6752#(= 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; {6753#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {6753#(<= 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; {6754#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {6754#(<= 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; {6755#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {6755#(<= 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; {6756#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {6756#(<= 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; {6757#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {6757#(<= 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; {6758#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {6758#(<= 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; {6759#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {6759#(<= 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; {6760#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:15,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {6760#(<= 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; {6761#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:15,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {6761#(<= 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; {6762#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:15,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {6762#(<= 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; {6763#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:15,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {6763#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,230 INFO L273 TraceCheckUtils]: 28: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,230 INFO L273 TraceCheckUtils]: 29: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 53: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,234 INFO L273 TraceCheckUtils]: 54: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 57: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 58: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 64: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 65: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 66: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 80: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 81: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 83: Hoare triple {6751#false} havoc ~x~0;~x~0 := 0; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 84: Hoare triple {6751#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L256 TraceCheckUtils]: 85: Hoare triple {6751#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 86: Hoare triple {6751#false} ~cond := #in~cond; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 87: Hoare triple {6751#false} assume 0 == ~cond; {6751#false} is VALID [2018-11-23 12:03:15,238 INFO L273 TraceCheckUtils]: 88: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2018-11-23 12:03:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 12:03:15,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:15,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:15,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:52,492 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:03:52,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:52,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:52,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {6750#true} call ULTIMATE.init(); {6750#true} is VALID [2018-11-23 12:03:52,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {6750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6750#true} is VALID [2018-11-23 12:03:52,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {6750#true} assume true; {6750#true} is VALID [2018-11-23 12:03:52,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6750#true} {6750#true} #113#return; {6750#true} is VALID [2018-11-23 12:03:52,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {6750#true} call #t~ret2 := main(); {6750#true} is VALID [2018-11-23 12:03:52,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {6750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6782#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:52,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {6782#(<= 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; {6753#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:52,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {6753#(<= 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; {6754#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:52,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {6754#(<= 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; {6755#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:52,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {6755#(<= 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; {6756#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:52,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {6756#(<= 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; {6757#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:52,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {6757#(<= 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; {6758#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:52,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {6758#(<= 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; {6759#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:52,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {6759#(<= 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; {6760#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:52,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {6760#(<= 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; {6761#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:52,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {6761#(<= 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; {6762#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:52,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {6762#(<= 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; {6763#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:52,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {6763#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 44: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 45: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 51: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 52: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 53: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 54: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,696 INFO L273 TraceCheckUtils]: 56: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 57: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 58: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 59: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 60: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 63: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,697 INFO L273 TraceCheckUtils]: 64: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 65: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 66: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 67: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 68: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 69: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 70: Hoare triple {6751#false} ~i~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 71: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 72: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,698 INFO L273 TraceCheckUtils]: 73: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 74: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 75: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 76: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 77: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 78: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 79: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {6751#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 82: Hoare triple {6751#false} assume !(~i~0 < 100000); {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 83: Hoare triple {6751#false} havoc ~x~0;~x~0 := 0; {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 84: Hoare triple {6751#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L256 TraceCheckUtils]: 85: Hoare triple {6751#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 86: Hoare triple {6751#false} ~cond := #in~cond; {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 87: Hoare triple {6751#false} assume 0 == ~cond; {6751#false} is VALID [2018-11-23 12:03:52,700 INFO L273 TraceCheckUtils]: 88: Hoare triple {6751#false} assume !false; {6751#false} is VALID [2018-11-23 12:03:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 12:03:52,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:52,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:03:52,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-11-23 12:03:52,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:52,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:03:52,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:52,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:03:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:03:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:52,783 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 15 states. [2018-11-23 12:03:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:53,486 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-11-23 12:03:53,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:03:53,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-11-23 12:03:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2018-11-23 12:03:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2018-11-23 12:03:53,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2018-11-23 12:03:54,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:54,101 INFO L225 Difference]: With dead ends: 176 [2018-11-23 12:03:54,101 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:03:54,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:03:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 12:03:54,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:54,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:54,165 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:54,166 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:54,168 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-23 12:03:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 12:03:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:54,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:54,168 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:54,169 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:54,171 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-23 12:03:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 12:03:54,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:54,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:54,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:54,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:03:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-11-23 12:03:54,174 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 89 [2018-11-23 12:03:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:54,174 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-11-23 12:03:54,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:03:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 12:03:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:03:54,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:54,176 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:03:54,176 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:54,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2080107158, now seen corresponding path program 12 times [2018-11-23 12:03:54,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:54,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:54,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:54,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:54,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-23 12:03:54,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-23 12:03:54,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-23 12:03:54,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #113#return; {7740#true} is VALID [2018-11-23 12:03:54,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-23 12:03:54,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7742#(= main_~i~0 0)} is VALID [2018-11-23 12:03:54,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {7742#(= 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; {7743#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:54,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {7743#(<= 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; {7744#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:54,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:54,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:54,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:54,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:54,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:54,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:54,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:54,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:54,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:54,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:54,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {7754#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,806 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 85: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 86: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 87: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-23 12:03:54,811 INFO L273 TraceCheckUtils]: 90: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-23 12:03:54,812 INFO L256 TraceCheckUtils]: 91: Hoare triple {7741#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-23 12:03:54,812 INFO L273 TraceCheckUtils]: 92: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-23 12:03:54,812 INFO L273 TraceCheckUtils]: 93: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-23 12:03:54,812 INFO L273 TraceCheckUtils]: 94: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-23 12:03:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-11-23 12:03:54,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:54,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:04:26,230 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:04:26,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:26,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:26,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {7740#true} call ULTIMATE.init(); {7740#true} is VALID [2018-11-23 12:04:26,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {7740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7740#true} is VALID [2018-11-23 12:04:26,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {7740#true} assume true; {7740#true} is VALID [2018-11-23 12:04:26,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7740#true} {7740#true} #113#return; {7740#true} is VALID [2018-11-23 12:04:26,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {7740#true} call #t~ret2 := main(); {7740#true} is VALID [2018-11-23 12:04:26,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {7740#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7809#(<= main_~i~0 100000)} is VALID [2018-11-23 12:04:26,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {7809#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7740#true} is VALID [2018-11-23 12:04:26,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {7740#true} ~i~0 := 0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,590 INFO L273 TraceCheckUtils]: 28: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7809#(<= main_~i~0 100000)} is VALID [2018-11-23 12:04:26,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {7809#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7740#true} is VALID [2018-11-23 12:04:26,591 INFO L273 TraceCheckUtils]: 33: Hoare triple {7740#true} ~i~0 := 0; {7740#true} is VALID [2018-11-23 12:04:26,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,591 INFO L273 TraceCheckUtils]: 35: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 37: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 40: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,592 INFO L273 TraceCheckUtils]: 42: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 43: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 44: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {7740#true} assume !(~i~0 < 100000); {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {7740#true} ~i~0 := 0; {7740#true} is VALID [2018-11-23 12:04:26,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,594 INFO L273 TraceCheckUtils]: 49: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,594 INFO L273 TraceCheckUtils]: 50: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,594 INFO L273 TraceCheckUtils]: 51: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,594 INFO L273 TraceCheckUtils]: 52: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,595 INFO L273 TraceCheckUtils]: 54: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,595 INFO L273 TraceCheckUtils]: 55: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,595 INFO L273 TraceCheckUtils]: 57: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,596 INFO L273 TraceCheckUtils]: 58: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7740#true} is VALID [2018-11-23 12:04:26,597 INFO L273 TraceCheckUtils]: 59: Hoare triple {7740#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7809#(<= main_~i~0 100000)} is VALID [2018-11-23 12:04:26,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {7809#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7740#true} is VALID [2018-11-23 12:04:26,597 INFO L273 TraceCheckUtils]: 61: Hoare triple {7740#true} ~i~0 := 0; {7942#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:26,598 INFO L273 TraceCheckUtils]: 62: Hoare triple {7942#(<= 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; {7743#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:26,598 INFO L273 TraceCheckUtils]: 63: Hoare triple {7743#(<= 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; {7744#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:26,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:26,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:26,601 INFO L273 TraceCheckUtils]: 66: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:26,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:26,604 INFO L273 TraceCheckUtils]: 68: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:26,605 INFO L273 TraceCheckUtils]: 69: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:26,606 INFO L273 TraceCheckUtils]: 70: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:26,607 INFO L273 TraceCheckUtils]: 71: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:26,608 INFO L273 TraceCheckUtils]: 72: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:26,609 INFO L273 TraceCheckUtils]: 73: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:26,610 INFO L273 TraceCheckUtils]: 74: Hoare triple {7754#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:04:26,610 INFO L273 TraceCheckUtils]: 75: Hoare triple {7741#false} ~i~0 := 0; {7741#false} is VALID [2018-11-23 12:04:26,610 INFO L273 TraceCheckUtils]: 76: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,611 INFO L273 TraceCheckUtils]: 77: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,611 INFO L273 TraceCheckUtils]: 78: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,611 INFO L273 TraceCheckUtils]: 79: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,611 INFO L273 TraceCheckUtils]: 80: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,612 INFO L273 TraceCheckUtils]: 81: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,612 INFO L273 TraceCheckUtils]: 82: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,612 INFO L273 TraceCheckUtils]: 83: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,612 INFO L273 TraceCheckUtils]: 84: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,613 INFO L273 TraceCheckUtils]: 85: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,613 INFO L273 TraceCheckUtils]: 86: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,613 INFO L273 TraceCheckUtils]: 87: Hoare triple {7741#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#false} is VALID [2018-11-23 12:04:26,613 INFO L273 TraceCheckUtils]: 88: Hoare triple {7741#false} assume !(~i~0 < 100000); {7741#false} is VALID [2018-11-23 12:04:26,613 INFO L273 TraceCheckUtils]: 89: Hoare triple {7741#false} havoc ~x~0;~x~0 := 0; {7741#false} is VALID [2018-11-23 12:04:26,614 INFO L273 TraceCheckUtils]: 90: Hoare triple {7741#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7741#false} is VALID [2018-11-23 12:04:26,614 INFO L256 TraceCheckUtils]: 91: Hoare triple {7741#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {7741#false} is VALID [2018-11-23 12:04:26,614 INFO L273 TraceCheckUtils]: 92: Hoare triple {7741#false} ~cond := #in~cond; {7741#false} is VALID [2018-11-23 12:04:26,614 INFO L273 TraceCheckUtils]: 93: Hoare triple {7741#false} assume 0 == ~cond; {7741#false} is VALID [2018-11-23 12:04:26,614 INFO L273 TraceCheckUtils]: 94: Hoare triple {7741#false} assume !false; {7741#false} is VALID [2018-11-23 12:04:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 36 proven. 78 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-23 12:04:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 12:04:26,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 12:04:26,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:26,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:04:26,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:26,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:04:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:04:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:26,729 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 17 states. [2018-11-23 12:04:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:27,520 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-11-23 12:04:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:04:27,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 12:04:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2018-11-23 12:04:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2018-11-23 12:04:27,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 144 transitions. [2018-11-23 12:04:28,127 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 12:04:28,130 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:04:28,131 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:04:28,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:04:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 12:04:28,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:28,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:28,213 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:28,213 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:28,216 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-11-23 12:04:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 12:04:28,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:28,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:28,217 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:28,218 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 12:04:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:28,220 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-11-23 12:04:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 12:04:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:28,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:28,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:28,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:04:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-11-23 12:04:28,223 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2018-11-23 12:04:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:28,224 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-11-23 12:04:28,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:04:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 12:04:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:04:28,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:28,225 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:04:28,226 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:28,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -332398029, now seen corresponding path program 13 times [2018-11-23 12:04:28,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:28,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:28,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:28,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:28,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {8796#true} call ULTIMATE.init(); {8796#true} is VALID [2018-11-23 12:04:29,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {8796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8796#true} is VALID [2018-11-23 12:04:29,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {8796#true} assume true; {8796#true} is VALID [2018-11-23 12:04:29,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8796#true} {8796#true} #113#return; {8796#true} is VALID [2018-11-23 12:04:29,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {8796#true} call #t~ret2 := main(); {8796#true} is VALID [2018-11-23 12:04:29,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {8796#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8798#(= main_~i~0 0)} is VALID [2018-11-23 12:04:29,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {8798#(= 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; {8799#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:29,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {8799#(<= 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; {8800#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:29,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {8800#(<= 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; {8801#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:29,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {8801#(<= 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; {8802#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:29,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {8802#(<= 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; {8803#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:29,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {8803#(<= 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; {8804#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:29,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {8804#(<= 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; {8805#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:29,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {8805#(<= 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; {8806#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:29,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {8806#(<= 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; {8807#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:29,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {8807#(<= 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; {8808#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:29,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {8808#(<= 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; {8809#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:29,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {8809#(<= 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; {8810#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:29,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {8810#(<= 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; {8811#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:29,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {8811#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,576 INFO L273 TraceCheckUtils]: 44: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 50: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 51: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 52: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 53: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,577 INFO L273 TraceCheckUtils]: 54: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 55: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 56: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 57: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 58: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 59: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,578 INFO L273 TraceCheckUtils]: 60: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,579 INFO L273 TraceCheckUtils]: 62: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,579 INFO L273 TraceCheckUtils]: 63: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 68: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 69: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 70: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,580 INFO L273 TraceCheckUtils]: 71: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,581 INFO L273 TraceCheckUtils]: 74: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,581 INFO L273 TraceCheckUtils]: 75: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 81: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,582 INFO L273 TraceCheckUtils]: 82: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 83: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 84: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 85: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 86: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 90: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 91: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 92: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 93: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L273 TraceCheckUtils]: 95: Hoare triple {8797#false} havoc ~x~0;~x~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L273 TraceCheckUtils]: 96: Hoare triple {8797#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L256 TraceCheckUtils]: 97: Hoare triple {8797#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L273 TraceCheckUtils]: 98: Hoare triple {8797#false} ~cond := #in~cond; {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L273 TraceCheckUtils]: 99: Hoare triple {8797#false} assume 0 == ~cond; {8797#false} is VALID [2018-11-23 12:04:29,585 INFO L273 TraceCheckUtils]: 100: Hoare triple {8797#false} assume !false; {8797#false} is VALID [2018-11-23 12:04:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2018-11-23 12:04:29,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:29,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:29,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:29,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {8796#true} call ULTIMATE.init(); {8796#true} is VALID [2018-11-23 12:04:29,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {8796#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8796#true} is VALID [2018-11-23 12:04:29,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {8796#true} assume true; {8796#true} is VALID [2018-11-23 12:04:29,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8796#true} {8796#true} #113#return; {8796#true} is VALID [2018-11-23 12:04:29,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {8796#true} call #t~ret2 := main(); {8796#true} is VALID [2018-11-23 12:04:29,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {8796#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8830#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:29,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {8830#(<= 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; {8799#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:29,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {8799#(<= 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; {8800#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:29,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {8800#(<= 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; {8801#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:29,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {8801#(<= 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; {8802#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:29,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {8802#(<= 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; {8803#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:29,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {8803#(<= 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; {8804#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:29,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {8804#(<= 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; {8805#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:29,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {8805#(<= 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; {8806#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:29,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {8806#(<= 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; {8807#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:29,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {8807#(<= 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; {8808#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:29,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {8808#(<= 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; {8809#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:29,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {8809#(<= 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; {8810#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:29,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {8810#(<= 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; {8811#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:29,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {8811#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 29: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 30: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,915 INFO L273 TraceCheckUtils]: 31: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 33: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 37: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,916 INFO L273 TraceCheckUtils]: 40: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 41: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 42: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 43: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 44: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 45: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 46: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 47: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 53: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 58: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 60: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 66: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 67: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 68: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 69: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 71: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 72: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 73: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 74: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 75: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,921 INFO L273 TraceCheckUtils]: 76: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 77: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 78: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 79: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 80: Hoare triple {8797#false} ~i~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 81: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 83: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 84: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 85: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 86: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 87: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 88: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,923 INFO L273 TraceCheckUtils]: 89: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 90: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 91: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 92: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 93: Hoare triple {8797#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 94: Hoare triple {8797#false} assume !(~i~0 < 100000); {8797#false} is VALID [2018-11-23 12:04:29,924 INFO L273 TraceCheckUtils]: 95: Hoare triple {8797#false} havoc ~x~0;~x~0 := 0; {8797#false} is VALID [2018-11-23 12:04:29,925 INFO L273 TraceCheckUtils]: 96: Hoare triple {8797#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8797#false} is VALID [2018-11-23 12:04:29,925 INFO L256 TraceCheckUtils]: 97: Hoare triple {8797#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {8797#false} is VALID [2018-11-23 12:04:29,925 INFO L273 TraceCheckUtils]: 98: Hoare triple {8797#false} ~cond := #in~cond; {8797#false} is VALID [2018-11-23 12:04:29,925 INFO L273 TraceCheckUtils]: 99: Hoare triple {8797#false} assume 0 == ~cond; {8797#false} is VALID [2018-11-23 12:04:29,925 INFO L273 TraceCheckUtils]: 100: Hoare triple {8797#false} assume !false; {8797#false} is VALID [2018-11-23 12:04:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2018-11-23 12:04:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:04:29,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-23 12:04:29,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:29,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:04:29,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:29,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:04:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:04:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:29,994 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 17 states. [2018-11-23 12:04:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:30,884 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-11-23 12:04:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:04:30,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-23 12:04:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 150 transitions. [2018-11-23 12:04:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:04:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 150 transitions. [2018-11-23 12:04:30,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 150 transitions. [2018-11-23 12:04:31,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:31,479 INFO L225 Difference]: With dead ends: 198 [2018-11-23 12:04:31,480 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:04:31,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:04:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:04:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 12:04:31,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:31,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 12:04:31,571 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 12:04:31,571 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 12:04:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:31,574 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 12:04:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 12:04:31,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:31,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:31,574 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 12:04:31,575 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 12:04:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:31,577 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 12:04:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 12:04:31,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:31,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:31,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:31,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:04:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 12:04:31,580 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 101 [2018-11-23 12:04:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:31,581 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 12:04:31,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:04:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 12:04:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 12:04:31,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:31,582 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:04:31,583 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:31,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash -904878026, now seen corresponding path program 14 times [2018-11-23 12:04:31,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:31,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:32,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {9916#true} call ULTIMATE.init(); {9916#true} is VALID [2018-11-23 12:04:32,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {9916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9916#true} is VALID [2018-11-23 12:04:32,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {9916#true} assume true; {9916#true} is VALID [2018-11-23 12:04:32,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9916#true} {9916#true} #113#return; {9916#true} is VALID [2018-11-23 12:04:32,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {9916#true} call #t~ret2 := main(); {9916#true} is VALID [2018-11-23 12:04:32,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {9916#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9918#(= main_~i~0 0)} is VALID [2018-11-23 12:04:32,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {9918#(= 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; {9919#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:32,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {9919#(<= 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; {9920#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:32,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {9920#(<= 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; {9921#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:32,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {9921#(<= 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; {9922#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:32,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {9922#(<= 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; {9923#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:32,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {9923#(<= 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; {9924#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:32,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {9924#(<= 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; {9925#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:32,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {9925#(<= 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; {9926#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:32,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {9926#(<= 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; {9927#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:32,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {9927#(<= 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; {9928#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:32,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {9928#(<= 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; {9929#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:32,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {9929#(<= 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; {9930#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:32,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {9930#(<= 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; {9931#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:32,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {9931#(<= 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; {9932#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:32,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {9932#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 47: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 52: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 53: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 74: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 78: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 79: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 80: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 81: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 82: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,422 INFO L273 TraceCheckUtils]: 83: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 84: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 85: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 86: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 87: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 88: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 89: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 90: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 91: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,423 INFO L273 TraceCheckUtils]: 92: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 93: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 94: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 95: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 96: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 97: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 98: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 99: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 100: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,424 INFO L273 TraceCheckUtils]: 101: Hoare triple {9917#false} havoc ~x~0;~x~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,425 INFO L273 TraceCheckUtils]: 102: Hoare triple {9917#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9917#false} is VALID [2018-11-23 12:04:32,425 INFO L256 TraceCheckUtils]: 103: Hoare triple {9917#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {9917#false} is VALID [2018-11-23 12:04:32,425 INFO L273 TraceCheckUtils]: 104: Hoare triple {9917#false} ~cond := #in~cond; {9917#false} is VALID [2018-11-23 12:04:32,425 INFO L273 TraceCheckUtils]: 105: Hoare triple {9917#false} assume 0 == ~cond; {9917#false} is VALID [2018-11-23 12:04:32,425 INFO L273 TraceCheckUtils]: 106: Hoare triple {9917#false} assume !false; {9917#false} is VALID [2018-11-23 12:04:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 12:04:32,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:32,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:32,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:32,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:32,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:32,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:32,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {9916#true} call ULTIMATE.init(); {9916#true} is VALID [2018-11-23 12:04:32,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {9916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9916#true} is VALID [2018-11-23 12:04:32,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {9916#true} assume true; {9916#true} is VALID [2018-11-23 12:04:32,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9916#true} {9916#true} #113#return; {9916#true} is VALID [2018-11-23 12:04:32,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {9916#true} call #t~ret2 := main(); {9916#true} is VALID [2018-11-23 12:04:32,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {9916#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9951#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:32,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {9951#(<= 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; {9919#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:32,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {9919#(<= 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; {9920#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:32,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {9920#(<= 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; {9921#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:32,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {9921#(<= 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; {9922#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:32,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {9922#(<= 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; {9923#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:32,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {9923#(<= 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; {9924#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:32,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {9924#(<= 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; {9925#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:32,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {9925#(<= 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; {9926#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:32,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {9926#(<= 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; {9927#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:32,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {9927#(<= 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; {9928#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:32,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {9928#(<= 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; {9929#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:32,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {9929#(<= 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; {9930#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:32,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {9930#(<= 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; {9931#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:32,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {9931#(<= 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; {9932#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:32,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {9932#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,829 INFO L273 TraceCheckUtils]: 25: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,829 INFO L273 TraceCheckUtils]: 27: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,830 INFO L273 TraceCheckUtils]: 28: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,830 INFO L273 TraceCheckUtils]: 29: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,830 INFO L273 TraceCheckUtils]: 30: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 37: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,831 INFO L273 TraceCheckUtils]: 40: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 42: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 43: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 45: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,832 INFO L273 TraceCheckUtils]: 49: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 53: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 54: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 59: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 61: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 62: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 63: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 67: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 68: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 70: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 71: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 77: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 78: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 79: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 80: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 81: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 82: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,836 INFO L273 TraceCheckUtils]: 83: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 84: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 85: Hoare triple {9917#false} ~i~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 86: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 87: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 88: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 89: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 93: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 94: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 95: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 96: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 98: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 99: Hoare triple {9917#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 100: Hoare triple {9917#false} assume !(~i~0 < 100000); {9917#false} is VALID [2018-11-23 12:04:32,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {9917#false} havoc ~x~0;~x~0 := 0; {9917#false} is VALID [2018-11-23 12:04:32,839 INFO L273 TraceCheckUtils]: 102: Hoare triple {9917#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9917#false} is VALID [2018-11-23 12:04:32,839 INFO L256 TraceCheckUtils]: 103: Hoare triple {9917#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {9917#false} is VALID [2018-11-23 12:04:32,839 INFO L273 TraceCheckUtils]: 104: Hoare triple {9917#false} ~cond := #in~cond; {9917#false} is VALID [2018-11-23 12:04:32,839 INFO L273 TraceCheckUtils]: 105: Hoare triple {9917#false} assume 0 == ~cond; {9917#false} is VALID [2018-11-23 12:04:32,839 INFO L273 TraceCheckUtils]: 106: Hoare triple {9917#false} assume !false; {9917#false} is VALID [2018-11-23 12:04:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 12:04:32,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:32,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:04:32,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-11-23 12:04:32,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:32,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:04:32,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:32,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:04:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:04:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:32,900 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 18 states. [2018-11-23 12:04:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:33,740 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-11-23 12:04:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:04:33,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-11-23 12:04:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2018-11-23 12:04:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:04:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2018-11-23 12:04:33,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 156 transitions. [2018-11-23 12:04:33,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:33,909 INFO L225 Difference]: With dead ends: 209 [2018-11-23 12:04:33,909 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:04:33,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:04:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:04:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-23 12:04:33,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:33,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-23 12:04:33,995 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 12:04:33,995 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 12:04:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:33,997 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 12:04:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 12:04:33,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:33,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:33,998 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 12:04:33,999 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 12:04:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:34,001 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 12:04:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 12:04:34,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:34,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:34,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:34,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 12:04:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-23 12:04:34,004 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 107 [2018-11-23 12:04:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:34,005 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-23 12:04:34,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:04:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 12:04:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 12:04:34,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:34,006 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:04:34,007 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:34,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2139869677, now seen corresponding path program 15 times [2018-11-23 12:04:34,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:34,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:34,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:34,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {11101#true} call ULTIMATE.init(); {11101#true} is VALID [2018-11-23 12:04:34,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {11101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11101#true} is VALID [2018-11-23 12:04:34,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {11101#true} assume true; {11101#true} is VALID [2018-11-23 12:04:34,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11101#true} {11101#true} #113#return; {11101#true} is VALID [2018-11-23 12:04:34,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {11101#true} call #t~ret2 := main(); {11101#true} is VALID [2018-11-23 12:04:34,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {11101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11103#(= main_~i~0 0)} is VALID [2018-11-23 12:04:34,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {11103#(= 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; {11104#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:34,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {11104#(<= 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; {11105#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:34,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {11105#(<= 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; {11106#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:34,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {11106#(<= 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; {11107#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:34,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {11107#(<= 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; {11108#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:34,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {11108#(<= 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; {11109#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:34,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {11109#(<= 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; {11110#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:34,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {11110#(<= 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; {11111#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:34,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {11111#(<= 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; {11112#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:34,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {11112#(<= 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; {11113#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:34,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {11113#(<= 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; {11114#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:34,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {11114#(<= 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; {11115#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:34,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {11115#(<= 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; {11116#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:34,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {11116#(<= 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; {11117#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:34,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {11117#(<= 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; {11118#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:34,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {11118#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,500 INFO L273 TraceCheckUtils]: 36: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,501 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,502 INFO L273 TraceCheckUtils]: 43: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,502 INFO L273 TraceCheckUtils]: 45: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 52: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 53: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,503 INFO L273 TraceCheckUtils]: 54: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 55: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 56: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 57: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 58: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 59: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 60: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 61: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 62: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,504 INFO L273 TraceCheckUtils]: 63: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 64: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 65: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 66: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 67: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 68: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 69: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,505 INFO L273 TraceCheckUtils]: 71: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 72: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 73: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 74: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 75: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 76: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 77: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 78: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 79: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,506 INFO L273 TraceCheckUtils]: 80: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 81: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 82: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 83: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 84: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 85: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 86: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 87: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 88: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,507 INFO L273 TraceCheckUtils]: 89: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 90: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 91: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 92: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 93: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 94: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 95: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 96: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,508 INFO L273 TraceCheckUtils]: 97: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 98: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 99: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 100: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 101: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 102: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 103: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 104: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 105: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:04:34,509 INFO L273 TraceCheckUtils]: 106: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L273 TraceCheckUtils]: 107: Hoare triple {11102#false} havoc ~x~0;~x~0 := 0; {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L273 TraceCheckUtils]: 108: Hoare triple {11102#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L256 TraceCheckUtils]: 109: Hoare triple {11102#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L273 TraceCheckUtils]: 110: Hoare triple {11102#false} ~cond := #in~cond; {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L273 TraceCheckUtils]: 111: Hoare triple {11102#false} assume 0 == ~cond; {11102#false} is VALID [2018-11-23 12:04:34,510 INFO L273 TraceCheckUtils]: 112: Hoare triple {11102#false} assume !false; {11102#false} is VALID [2018-11-23 12:04:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-23 12:04:34,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:34,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:17,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:05:17,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:17,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:18,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {11101#true} call ULTIMATE.init(); {11101#true} is VALID [2018-11-23 12:05:18,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {11101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11101#true} is VALID [2018-11-23 12:05:18,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {11101#true} assume true; {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11101#true} {11101#true} #113#return; {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {11101#true} call #t~ret2 := main(); {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {11101#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {11101#true} assume !(~i~0 < 100000); {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {11101#true} ~i~0 := 0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {11101#true} assume !(~i~0 < 100000); {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {11101#true} ~i~0 := 0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 41: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 42: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,060 INFO L273 TraceCheckUtils]: 43: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 44: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 45: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 46: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 47: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 48: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,062 INFO L273 TraceCheckUtils]: 54: Hoare triple {11101#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11101#true} is VALID [2018-11-23 12:05:18,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {11101#true} assume !(~i~0 < 100000); {11101#true} is VALID [2018-11-23 12:05:18,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {11101#true} ~i~0 := 0; {11290#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:18,063 INFO L273 TraceCheckUtils]: 57: Hoare triple {11290#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11104#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:18,063 INFO L273 TraceCheckUtils]: 58: Hoare triple {11104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:18,064 INFO L273 TraceCheckUtils]: 59: Hoare triple {11105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:18,065 INFO L273 TraceCheckUtils]: 60: Hoare triple {11106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11107#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:18,066 INFO L273 TraceCheckUtils]: 61: Hoare triple {11107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11108#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:18,067 INFO L273 TraceCheckUtils]: 62: Hoare triple {11108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11109#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:18,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {11109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11110#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:18,069 INFO L273 TraceCheckUtils]: 64: Hoare triple {11110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11111#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:18,069 INFO L273 TraceCheckUtils]: 65: Hoare triple {11111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11112#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:18,070 INFO L273 TraceCheckUtils]: 66: Hoare triple {11112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11113#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:18,071 INFO L273 TraceCheckUtils]: 67: Hoare triple {11113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11114#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:18,072 INFO L273 TraceCheckUtils]: 68: Hoare triple {11114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11115#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:18,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {11115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11116#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:18,074 INFO L273 TraceCheckUtils]: 70: Hoare triple {11116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11117#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:18,075 INFO L273 TraceCheckUtils]: 71: Hoare triple {11117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11118#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:18,075 INFO L273 TraceCheckUtils]: 72: Hoare triple {11118#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:05:18,076 INFO L273 TraceCheckUtils]: 73: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:05:18,076 INFO L273 TraceCheckUtils]: 74: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,076 INFO L273 TraceCheckUtils]: 75: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,076 INFO L273 TraceCheckUtils]: 76: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,077 INFO L273 TraceCheckUtils]: 81: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,078 INFO L273 TraceCheckUtils]: 82: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,078 INFO L273 TraceCheckUtils]: 84: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,078 INFO L273 TraceCheckUtils]: 85: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 87: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 90: Hoare triple {11102#false} ~i~0 := 0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,079 INFO L273 TraceCheckUtils]: 93: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 95: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 97: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 98: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 99: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 100: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,080 INFO L273 TraceCheckUtils]: 101: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 102: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 103: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 104: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 105: Hoare triple {11102#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 106: Hoare triple {11102#false} assume !(~i~0 < 100000); {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 107: Hoare triple {11102#false} havoc ~x~0;~x~0 := 0; {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 108: Hoare triple {11102#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L256 TraceCheckUtils]: 109: Hoare triple {11102#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {11102#false} is VALID [2018-11-23 12:05:18,081 INFO L273 TraceCheckUtils]: 110: Hoare triple {11102#false} ~cond := #in~cond; {11102#false} is VALID [2018-11-23 12:05:18,082 INFO L273 TraceCheckUtils]: 111: Hoare triple {11102#false} assume 0 == ~cond; {11102#false} is VALID [2018-11-23 12:05:18,082 INFO L273 TraceCheckUtils]: 112: Hoare triple {11102#false} assume !false; {11102#false} is VALID [2018-11-23 12:05:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-23 12:05:18,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:18,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:05:18,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2018-11-23 12:05:18,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:18,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:05:18,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:18,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:05:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:05:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:18,197 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 19 states. [2018-11-23 12:05:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,463 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-11-23 12:05:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:05:19,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2018-11-23 12:05:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 162 transitions. [2018-11-23 12:05:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 162 transitions. [2018-11-23 12:05:19,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 162 transitions. [2018-11-23 12:05:19,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:19,647 INFO L225 Difference]: With dead ends: 220 [2018-11-23 12:05:19,647 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 12:05:19,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 12:05:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-23 12:05:19,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:19,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 124 states. [2018-11-23 12:05:19,749 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 12:05:19,749 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 12:05:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,751 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-23 12:05:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 12:05:19,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,751 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 12:05:19,752 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 12:05:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,754 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-23 12:05:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 12:05:19,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:19,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 12:05:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-11-23 12:05:19,757 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 113 [2018-11-23 12:05:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:19,757 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-11-23 12:05:19,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:05:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 12:05:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:05:19,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:19,759 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 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 12:05:19,759 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:19,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash -243049002, now seen corresponding path program 16 times [2018-11-23 12:05:19,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:19,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:19,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:19,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {12351#true} call ULTIMATE.init(); {12351#true} is VALID [2018-11-23 12:05:20,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {12351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12351#true} is VALID [2018-11-23 12:05:20,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {12351#true} assume true; {12351#true} is VALID [2018-11-23 12:05:20,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12351#true} {12351#true} #113#return; {12351#true} is VALID [2018-11-23 12:05:20,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {12351#true} call #t~ret2 := main(); {12351#true} is VALID [2018-11-23 12:05:20,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {12351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12353#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {12353#(= 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; {12354#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {12354#(<= 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; {12355#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {12355#(<= 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; {12356#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {12356#(<= 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; {12357#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {12357#(<= 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; {12358#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {12358#(<= 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; {12359#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {12359#(<= 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; {12360#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {12360#(<= 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; {12361#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {12361#(<= 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; {12362#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {12362#(<= 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; {12363#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {12363#(<= 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; {12364#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {12364#(<= 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; {12365#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {12365#(<= 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; {12366#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {12366#(<= 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; {12367#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {12367#(<= 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; {12368#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {12368#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12369#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {12369#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 36: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 42: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 44: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 49: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,304 INFO L273 TraceCheckUtils]: 50: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 52: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 53: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 54: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 55: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 56: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 57: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 58: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,305 INFO L273 TraceCheckUtils]: 59: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 60: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 61: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 64: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 66: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,306 INFO L273 TraceCheckUtils]: 67: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 69: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 70: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 71: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 74: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 75: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,307 INFO L273 TraceCheckUtils]: 76: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 77: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 78: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 79: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 80: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 81: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 82: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 83: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 84: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,308 INFO L273 TraceCheckUtils]: 85: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 86: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 87: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 88: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 89: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 90: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 91: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 92: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,309 INFO L273 TraceCheckUtils]: 93: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 94: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 95: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 96: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 97: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 98: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 99: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 100: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 101: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,310 INFO L273 TraceCheckUtils]: 102: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 103: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 104: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 105: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 106: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 107: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 108: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 109: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 110: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,311 INFO L273 TraceCheckUtils]: 111: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 112: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 113: Hoare triple {12352#false} havoc ~x~0;~x~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 114: Hoare triple {12352#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L256 TraceCheckUtils]: 115: Hoare triple {12352#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 116: Hoare triple {12352#false} ~cond := #in~cond; {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 117: Hoare triple {12352#false} assume 0 == ~cond; {12352#false} is VALID [2018-11-23 12:05:20,312 INFO L273 TraceCheckUtils]: 118: Hoare triple {12352#false} assume !false; {12352#false} is VALID [2018-11-23 12:05:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-23 12:05:20,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:20,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:20,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:20,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:20,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:20,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {12351#true} call ULTIMATE.init(); {12351#true} is VALID [2018-11-23 12:05:20,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {12351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12351#true} is VALID [2018-11-23 12:05:20,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {12351#true} assume true; {12351#true} is VALID [2018-11-23 12:05:20,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12351#true} {12351#true} #113#return; {12351#true} is VALID [2018-11-23 12:05:20,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {12351#true} call #t~ret2 := main(); {12351#true} is VALID [2018-11-23 12:05:20,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {12351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12388#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:20,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {12388#(<= 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; {12354#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {12354#(<= 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; {12355#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:20,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {12355#(<= 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; {12356#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:20,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {12356#(<= 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; {12357#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:20,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {12357#(<= 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; {12358#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:20,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {12358#(<= 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; {12359#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:20,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {12359#(<= 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; {12360#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:20,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {12360#(<= 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; {12361#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:20,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {12361#(<= 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; {12362#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:20,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {12362#(<= 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; {12363#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:20,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {12363#(<= 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; {12364#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:20,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {12364#(<= 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; {12365#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:20,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {12365#(<= 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; {12366#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:20,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {12366#(<= 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; {12367#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:20,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {12367#(<= 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; {12368#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:20,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {12368#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12369#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:20,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {12369#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 34: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 39: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 40: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 43: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 45: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 46: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 52: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 53: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 54: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 56: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 62: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 65: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 66: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 67: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,614 INFO L273 TraceCheckUtils]: 68: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 69: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 70: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 74: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 76: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,615 INFO L273 TraceCheckUtils]: 77: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 79: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 80: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 81: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 82: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 83: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 84: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,616 INFO L273 TraceCheckUtils]: 85: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 86: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 87: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 88: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 89: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 90: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 91: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 92: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 93: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,617 INFO L273 TraceCheckUtils]: 94: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 95: Hoare triple {12352#false} ~i~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 96: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 97: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 98: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 99: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 100: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 101: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 102: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,618 INFO L273 TraceCheckUtils]: 103: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 104: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 105: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 106: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 107: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 108: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 109: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 110: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 111: Hoare triple {12352#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#false} is VALID [2018-11-23 12:05:20,619 INFO L273 TraceCheckUtils]: 112: Hoare triple {12352#false} assume !(~i~0 < 100000); {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 113: Hoare triple {12352#false} havoc ~x~0;~x~0 := 0; {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 114: Hoare triple {12352#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L256 TraceCheckUtils]: 115: Hoare triple {12352#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 116: Hoare triple {12352#false} ~cond := #in~cond; {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 117: Hoare triple {12352#false} assume 0 == ~cond; {12352#false} is VALID [2018-11-23 12:05:20,620 INFO L273 TraceCheckUtils]: 118: Hoare triple {12352#false} assume !false; {12352#false} is VALID [2018-11-23 12:05:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-23 12:05:20,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:20,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:05:20,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-11-23 12:05:20,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:20,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:05:20,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:20,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:05:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:05:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:20,686 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 20 states. [2018-11-23 12:05:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,162 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2018-11-23 12:05:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:05:23,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-11-23 12:05:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 168 transitions. [2018-11-23 12:05:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 168 transitions. [2018-11-23 12:05:23,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 168 transitions. [2018-11-23 12:05:23,353 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 12:05:23,357 INFO L225 Difference]: With dead ends: 231 [2018-11-23 12:05:23,357 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:05:23,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:05:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-23 12:05:23,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 130 states. [2018-11-23 12:05:23,442 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 130 states. [2018-11-23 12:05:23,442 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 130 states. [2018-11-23 12:05:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,444 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 12:05:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 12:05:23,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,444 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 130 states. [2018-11-23 12:05:23,444 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 130 states. [2018-11-23 12:05:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,446 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 12:05:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 12:05:23,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 12:05:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-11-23 12:05:23,448 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 119 [2018-11-23 12:05:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,448 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-11-23 12:05:23,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:05:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 12:05:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 12:05:23,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,449 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 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 12:05:23,449 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 767435251, now seen corresponding path program 17 times [2018-11-23 12:05:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {13666#true} call ULTIMATE.init(); {13666#true} is VALID [2018-11-23 12:05:24,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {13666#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13666#true} is VALID [2018-11-23 12:05:24,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {13666#true} assume true; {13666#true} is VALID [2018-11-23 12:05:24,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13666#true} {13666#true} #113#return; {13666#true} is VALID [2018-11-23 12:05:24,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {13666#true} call #t~ret2 := main(); {13666#true} is VALID [2018-11-23 12:05:24,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {13666#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13668#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {13668#(= 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; {13669#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {13669#(<= 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; {13670#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {13670#(<= 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; {13671#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {13671#(<= 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; {13672#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {13672#(<= 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; {13673#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {13673#(<= 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; {13674#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {13674#(<= 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; {13675#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {13675#(<= 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; {13676#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {13676#(<= 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; {13677#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {13677#(<= 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; {13678#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {13678#(<= 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; {13679#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {13679#(<= 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; {13680#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {13680#(<= 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; {13681#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {13681#(<= 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; {13682#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {13682#(<= 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; {13683#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {13683#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13684#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {13684#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13685#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {13685#(<= main_~i~0 17)} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {13667#false} ~i~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,479 INFO L273 TraceCheckUtils]: 38: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 40: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {13667#false} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {13667#false} ~i~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,481 INFO L273 TraceCheckUtils]: 55: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {13667#false} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {13667#false} ~i~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 67: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 68: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 71: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,483 INFO L273 TraceCheckUtils]: 72: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 74: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 75: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 76: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 77: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 78: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 79: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 80: Hoare triple {13667#false} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,484 INFO L273 TraceCheckUtils]: 81: Hoare triple {13667#false} ~i~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 82: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 83: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 84: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 85: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 86: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 87: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 88: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 89: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,485 INFO L273 TraceCheckUtils]: 90: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 91: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 92: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 93: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 95: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 96: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 97: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,486 INFO L273 TraceCheckUtils]: 98: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 99: Hoare triple {13667#false} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 100: Hoare triple {13667#false} ~i~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 101: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 102: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 103: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 104: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 105: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 106: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,487 INFO L273 TraceCheckUtils]: 107: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 108: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 109: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 110: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 111: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 112: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 113: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 114: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 115: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,488 INFO L273 TraceCheckUtils]: 116: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 117: Hoare triple {13667#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 118: Hoare triple {13667#false} assume !(~i~0 < 100000); {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 119: Hoare triple {13667#false} havoc ~x~0;~x~0 := 0; {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 120: Hoare triple {13667#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L256 TraceCheckUtils]: 121: Hoare triple {13667#false} call __VERIFIER_assert((if 47 == #t~mem1 then 1 else 0)); {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 122: Hoare triple {13667#false} ~cond := #in~cond; {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 123: Hoare triple {13667#false} assume 0 == ~cond; {13667#false} is VALID [2018-11-23 12:05:24,489 INFO L273 TraceCheckUtils]: 124: Hoare triple {13667#false} assume !false; {13667#false} is VALID [2018-11-23 12:05:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-23 12:05:24,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:24,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1